Journal
DISCRETE OPTIMIZATION
Volume 8, Issue 2, Pages 246-258Publisher
ELSEVIER
DOI: 10.1016/j.disopt.2010.09.003
Keywords
Pricing; Bilevel programming; Networks; Column generation; Combinatorial optimization
Ask authors/readers for more resources
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. (C) 2010 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available