Skip to Main content Skip to Navigation
New interface
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
Contributor : Luce Brotcorne Connect in order to contact the contributor
Submitted on : Friday, November 4, 2011 - 5:44:31 PM
Last modification on : Thursday, January 20, 2022 - 5:27:54 PM

Links full text



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



Record views