Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design-Reference-Cited by-同舟云学术

Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design

Published:2004 Issue: Volume: Page:726-730
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2004
language:
Short-container-title:

Author:

Cronholm Wilhelm,Ajili Farid

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30201-8_55.pdf

Reference12 articles.

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)

2. Bienstock, D., Bley, A.: Capacitated network design with multicast commodities. Tech. Rep. ZIB 00–14, Konrad-Zuse-Zentrum für Inform., Berlin (2000)

3. Cronholm, W.: 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. Guignard, M., Kim, S.: Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Program. 39 (1987)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constraint programming and operations research;Constraints;2017-12-29

2. General Bounding Mechanism for Constraint Programs;Lecture Notes in Computer Science;2015

3. A Lagrangian Relaxation for Golomb Rulers;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2013

4. Data transfer planning with tree placement for collaborative environments;Constraints;2011-04-15

5. Constraint Based Resilience Analysis;Principles and Practice of Constraint Programming - CP 2006;2006