Strong cost-based filtering for lagrange decomposition applied to network design

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

Volumn 3258, Issue , 2004, Pages 726-730

  Cronholm, Wilhelm ^a   Ajili, Farid ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LAGRANGE MULTIPLIERS; MULTICASTING; NETWORK ROUTING;

CONSTRAINT PROGRAMMING; FILTERING RULES; HYBRID ALGORITHMS; MINIMUM COST; MULTICAST NETWORK; MULTICAST ROUTING; NETWORK DESIGN; SUB-PROBLEMS;

COSTS;

EID: 35048893930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_55     Document Type: Article

References (12)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey, 1993.
2. D. Bienstock and A. Bley. Capacitated network design with multicast commodities. Tech. Rep. ZIB 00-14, Konrad-Zuse-Zentrum für Inform., Berlin, 2000.
3. W. Cronholm. CP-based lagrange decomposition applied to multicast network design. PhD transfer thesis, IC-Parc, Imperial, London UK, 2004.
4. ECLiPSe. Introduction. Tech. Rep. IC-PARC-03-01, Imperial, London UK, 2002.
5. M. Guignard and S. Kim. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Program., 39, 1987.
6. K. Holmberg and D. Yuan. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res., 48(3), 2000.
7. T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32(3), 1998.
8. S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons Ltd, 1990.
9. M. Milano, editor. Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic Publishers, 2003.
10. W. Ouaja and B. Richards. A hybrid multicommodity routing algorithm for traffic engineering. Networks, 43(3), 2004.
11. M. Prytz and A. Forsgren. Dimensioning multicast-enabled communications networks. Networks, 39(4), 2002.
12. M. Sellmann and T. Fahle. CP-based Lagrangian relaxation for the automatic recording problem. Ann. Oper. Res., 118(1), 2003.