Robust and Parallel Solving of a Network Design Problem-Reference-Cited by-同舟云学术

Robust and Parallel Solving of a Network Design Problem

Published:2002 Issue: Volume: Page:633-648
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Le Pape Claude,Perron Laurent,Régin Jean-Charles,Shaw Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46135-3_42

Reference12 articles.

1. J. Christopher Beck and Laurent Perron. Discrepancy-Bounded Depth First Search. In Proceedings of CP-AI-OR 00, March 2000.

2. Raphaël Bernhard, Jacques Chambon, Claude Lepape, Laurent Perron, and Jean Charles Régin. Résolution d’un probléme de conception de réseau avec parallel solver. In Proceeding of JFPLC, 2002. (In French).

3. Daniel Bienstock and Oktay Günlük. Capacitated network design: Polyhedral structure and computation. ORS A J, 1996:243–260, 1996.

4. Cplex. ILOG CPLEX 7.5 User’s Manual and Reference Manual. ILOG, S.A., 2001.

5. V. Gabrel, A. Knippel, and M. Minoux. Exact solution of multicommodity network optimization problems with general step cost functions. Operations Research Letters, 25:15–23, 1999.

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

1. Constraint Games for stable and optimal allocation of demands in SDN;Constraints;2019-08-07

2. Using Graph-Based CSP to Solve the Address Translation Problem;Lecture Notes in Computer Science;2016

3. The salesman and the tree: the importance of search in CP;Constraints;2014-12-06

4. Parallel Discrepancy-Based Search;Lecture Notes in Computer Science;2013

5. Global Constraints: A Survey;Hybrid Optimization;2010-10-23