Hybrid Lagrangian relaxation for bandwidth-constrained routing: Knapsack decomposition

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2005, Pages 383-387

  Ouaja, Wided ^a   Richards, Barry ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Constraint propagation; Integer multicommodity flow problems; Lagrangian relaxation; Network routing

Indexed keywords

BANDWIDTH; HEURISTIC METHODS; INTERNET; OPTIMIZATION; PROBLEM SOLVING; QUALITY OF SERVICE; RELAXATION PROCESSES;

CONSTRAINT PROPAGATION; INTEGER MULTICOMMODITY FLOW PROBLEMS; LAGRANGIAN RELAXATION; NETWORK ROUTING;

CONSTRAINT THEORY;

EID: 33644515281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066677.1066766     Document Type: Conference Paper

References (11)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network flows: Theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. C. Barnhart, C. A. Hane, and P. H. Vance. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res., 48:318-326, 2000.
3. T. Benoist, F. Laburthe, and B. Rottembourg. Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. In Proc CPAIOR'01, pages 15-26, 2001.
4. W. Cronholm and F. Ajili. Strong cost-based filtering for Lagrange decomposition applied to network design. In Proc CP'04, pages 726-730, 2004.
5. W. Cronholm, W. Ouaja, and F. Ajili. Strengthening optimality reasoning for a network routing application. In Proc CoSolv'04, CP'04, September 2004.
6. Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In Proc ICNP'97, pages 191-202, 1997.
7. W. Ouaja and B. Richards. A hybrid solver for optimal routing of bandwidth-guaranteed traffic. In Proc INOC'03, pages 441-447, 2003.
8. W. Ouaja and B. Richards. A hybrid multicommodity routing algorithm for traffic engineering. Networks, 43(3):125-140, 2004.
9. M. Sellmann and T. Fahle. Constraint programming based Lagrangian relaxation for the automatic recording problem. Annals of OR, 118:17-33, 2003.
10. M. Sellmann, G. Kliewer, and A. Koberstein. Capacitated network design. In Proc ESA'02, pages 845-858, 2002.
11. Y. Wang and Z. Wang. Explicit routing algorithms for internet traffic engineering. In Proc ICCCN'99, pages 582-588, 1999.