J. , C. Beck, and L. Perron, Discrepancy bounded depth first search, Second workshop on integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), 2000.

R. Bernhard, J. Chambon, C. L. Pape, L. Perron, and J. Régin, Résolution d'unprobì eme de conception de réseau avec parallel solver, Journées Francophones de Programmation Logique par Contraintes (JF- PLC), pp.151-166, 2002.

J. Christianbessì-ere and . Régin, Enforcing arc consistency on global constraints by solving subproblems on the fly, 5th International conference on principles and practice of constraint programming (CP), pp.103-117, 1999.

H. Cambazard, Conception de réseaux et optimisation combinatoire : ´ etude d'unprobì eme de multiflot monorouté sous contraintes opérationnelles, 2003.

H. Cambazard and E. Bourreau, Conception d'une contrainte globale de chemin, 10e Journées nationales sur la résolution pratique de probì emes NP-complets (JNPC'04), pp.107-121, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00448531

A. Chabrier, E. Danna, C. L. Pape, and L. Perron, Solving a Network Design Problem, Annals of Operations Research, vol.130, issue.1-4, pp.217-239, 2004.
DOI : 10.1023/B:ANOR.0000032577.81139.84

D. Eppstein, Finding the k Shortest Paths, SIAM Journal on Computing, vol.28, issue.2, pp.652-673, 1998.
DOI : 10.1137/S0097539795290477

E. Gourdin, M. Labbé, and H. Yaman, Facility Location : Applications and Theory, chapter 9 Telecommunication and Location, 2002.

L. Jeannin and S. De-givry, Network planning with constraint programming, International Network Optimization Conference (INOC), 2003.

U. Menne, LP approaches to survivable networks with single path routing. Diploma Theses, 2003.

S. Pallottino and M. Graziascutelì, A new algorithm for reoptimizing shortest paths when the arc costs change. Networks, pp.149-160, 2003.

C. Le-pape, L. Perron, J. Régin, and P. Shaw, Robust and Parallel Solving of a Network Design Problem, 8th International conference on principles and practice of constraint programming (CP), pp.633-648, 2002.
DOI : 10.1007/3-540-46135-3_42

L. Perron, Parallel and random solving of a network design problem, Workshop on Random Search of AAAI Conference (WAAAI), 2002.

L. Perron, Practical parallelism in constraint programming, 4th International workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp.261-275, 2002.

L. Perron, Fast restart policies and large neighborhood search, 5th International workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2003.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, 10th International conference on principles and practice of constraint programming (CP), pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1328

B. M. Smith, Handbook of Constraint programming , chapter Chapter 11, Modelling, pp.377-406, 2006.