| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141506 | Discrete Optimization | 2011 | 13 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
L. Brotcorne, F. Cirinei, P. Marcotte, G. Savard,