Lagrangian cardinality cuts and variable fixing for capacitated network design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 845-858

  Sellmann, Meinolf ^a   Kliewer, Georg ^a   Koberstein, Achim ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD;

BRANCH-AND-BOUND APPROACHES; CAPACITATED NETWORK DESIGN; CARDINALITIES; LAGRANGIAN; LAGRANGIAN RELAXATION; VARIABLE FIXING;

LAGRANGE MULTIPLIERS;

EID: 84938087087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_73     Document Type: Conference Paper

References (15)

1. R.K. Ahuja, T. L. Magnati, J. B. Orlin. Network Flows Prentice Hall, 1993.
2. D. Bienstock, O. Gunluk, S. Chopra, C. Y. Tsai. Mininum cost capacity installation for multicommodity flows. Mathematical Programming, 81:177-199, 1998. 847
3. D. Bienstock. Experiments with a network design algorithm using epsilon-approximate linear programs. CORC Report 1999-4. 847
4. T. G. Crainic, A. Frangioni, B. Gendron. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics, 112: 73-99, 2001. 847, 849, 852, 855
5. T. G. Crainic, M. Gendreau, and J. M. Farvolden. A simplex-based tabu search method for capacitated network design. INFORMS Journal on Computing, 12(3):223-236, 2000. 852, 855
6. A. Frangioni. Dual Ascent Methods and Multicommodity Flow Problems. Ph.D. Dissertation TD 97-5, Dip. di Informatica, Univ. di Pisa, 1997. 848
7. I. Ghamlouche, T. G. Crainic, M. Gendreau. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Technical report CRT-2001-01. Centre de recherche sur les transports, Universitede Montreal. 855
8. I. Ghamlouche, T. G. Crainic, M. Gendreau. Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design Technical report CRT-2002-01. Centre de recherche sur les transports, UniversitedeMontreal. 855
9. M. Held and R. M. Karp. The travelling-salesman problem and minimum spanning trees. Operations Research, 18:1138-1162, 1970. 848
10. M. Held and R. M. Karp. The travelling-salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1:6-25, 1971. 848
11. K. Holmberg and D. Yuan. A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Operations Research, 48: 461-481, 2000. 847, 851, 852, 853
12. S. Martello and P. Toth. An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research, 1:169-175, 1977. 849
13. S. Martello and P. Toth. Knapsack Problems - Algorithms and Computer Implementations. Wiley Interscience, 1990. 849
14. M. Sellmann and T. Fahle. Coupling Variable Fixing Algorithms for the Automatic Recording Problem. 9th Annual European Symposium on Algorithms (ESA 2001), Springer LNCS 2161: 134-145, 2001. 850
15. M. Sellmann, G. Kliewer, A. Koberstein. Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. Technical report tr-ri-02-234. University of Paderborn. 846, 848, 852