Solving a network design problem

Annals of Operations Research

Volumn 130, Issue 1-4, 2004, Pages 217-239

  Chabrier, Alain ^a   Danna, Emilie ^b,c   Le Pape, Claude ^b   Perron, Laurent ^b  

^a ILOG   (Spain)

^b IBM   (United States)

^c UNIVERSITY OF AVIGNON   (France)

Author keywords

Branch and price; Constraint programming; Industrial benchmark; Mixed integer programming; Network design

Indexed keywords

EID: 3142680890     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000032577.81139.84     Document Type: Article

References (18)

1. Beck, J.C. and L. Perron. (2000). "Discrepancy-Bounded Depth First Search." In Proceedings of CP-AI-OR 2000.
2. Bernhard, R., J. Chambon, C. Le Pape, L. Perron, and J.-C. Régin. (2002). "Résolution d'un problème de conception de réseau avec Parallel Solver." In Proceedings of JFPLC. (In French.)
3. Bienstock, D. and O. Günlük. (1996). "Capacitated Network Design: Polyhedral Structure and Computation." ORSA Journal 8, 243-260.
4. Chabrier, A. (2003). "Heuristic Branch-and-Price-and-Cut to Solve a Network Design Problem." In Proceedings of CPAIOR 2003.
5. Danna, E., E. Rothberg, and C. Le Pape. (2003). "Exploring Relaxation Induced Neighborhoods to Improve MIP Solutions." Technical Report, ILOG.
6. Fischetti, M. and A. Lodi. (2002). "Local Branching." In Proceedings of the Integer Programming Conference in Honor of Egon Balas.
7. Gabrel, V., A. Knippel, and M. Minoux. (1999). "Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions." Operations Research Letters 25, 15-23.
8. Gomes, C.P. and B. Selman. (1997). "Algorithm Portfolio Design: Theory vs. Practice." In Proceedings of the 13th Conference On Uncertainty in Artificial Intelligence (UAI-97). New Providence, RI: Morgan Kaufmann.
9. Gondran, M. and M. Minoux. (1995). Graphes et algorithmes. Eyrolles.
10. ILOG. (2001). "ILOG CPLEX 7.5 User's Manual and Reference Manual." ILOG, S.A.
11. Perron, L. (1999). "Search Procedures and Parallelism in Constraint Programming." In J. Jaffar (ed.), Proceedings of CP'99, pp. 346-360. Berlin: Springer.
12. Perron, L. (2002). "Practical Parallelism in Constraint Programming." In Proceedings of CP-AI-OR 2002, pp. 261-276.
13. Perron, L. (2003). "Fast Restart Policies and Large Neighborhood Search." In Proceedings of CPAIOR 2003.
14. Rothlauf, F., D.E. Goldberg, and A. Heinzl. (2002). "Network Random Keys: A Tree Representation Scheme for Genetic and Evolutionary Algorithms." Evolutionary Computation 10(1), 75-97.
15. Shaw, P. (1998). "Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems." In M. Maher and J.-F. Puget (eds.), Proceedings of CP'98, pp. 417-431. Berlin: Springer.
16. Shaw, P., V. Furnon, and B. De Backer. (2000). "A Lightweight Addition to CP Frameworks for Improved Local Search." In U. Junker, S.E. Karisch, and T. Fahle (eds.), Proceedings of CP-AI-OR 2000.
17. Shaw, P., V. Furnon, and B. De Backer. (2002). "A Constraint Programming Toolkit for Local Search." In S. Voss and D. L. Woodruff (eds.), Optimization Software Class Libraries, pp. 219-262. Dordrecht: Kluwer Academic.
18. ILOG. (2002). "ILOG Solver 5.3 User's Manual and Reference Manual." ILOG, S.A.