Skip to Main content Skip to Navigation
Journal articles

An exact algorithm for the network pricing problem

Abstract : This work focuses on an improved exact algorithm for addressing an NP-hard network pricing problem. The method involves an efficient and partial generation of candidate solutions, a recursive scheme for generating improved upper bounds, and a column generation procedure for solving the network-structured subproblems. Its efficiency is assessed against both randomly generated instances involving three distinct topologies as well as instances based on real life situations in telecommunication and freight transportation.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00638444
Contributor : Luce Brotcorne <>
Submitted on : Friday, November 4, 2011 - 5:44:31 PM
Last modification on : Thursday, September 2, 2021 - 5:01:06 PM

Links full text

Identifiers

Citation

Luce Brotcorne, Fabien Cirinei, Patrice Marcotte, Gilles Savard. An exact algorithm for the network pricing problem. Discrete Optimization, Elsevier, 2011, 8 (2), pp.246-258. ⟨10.1016/j.disopt.2010.09.003⟩. ⟨inria-00638444⟩

Share

Metrics

Record views

300