V. Gabrel, A. Knippel, and M. Minoux, Exact solution of multicommodity network optimization problems with general step cost functions, Operations Research Letters, vol.25, issue.1, pp.15-23, 1999.
DOI : 10.1016/S0167-6377(99)00020-6
URL : https://hal.archives-ouvertes.fr/hal-01150534

D. William, M. L. Harvey, and . Ginsberg, Limited discrepancy search, Proceedings of the Fourteenth International Joint Conference on Articial Intelligence (IJCAI-95), 1995.

K. Holmberg and D. Yuan, A multicommodity network-ow problem with side constraints on paths solved by column generation, INFORMS Journal on Computing, vol.15, issue.1, p.4257, 2003.

M. Lauvergne, Réservation de connexions avec reroutage pour les réseaux ATM : une approche hybride par programmation par contraintes, 2002.

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

M. Milano and W. Jan-van-hoeve, Reduced Cost-Based Ranking for Generating Promising Subproblems, 8th International conference on principles and practice of constraint programming (CP), p.116, 2002.
DOI : 10.1007/3-540-46135-3_1
URL : http://arxiv.org/abs/cs/0407044

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), p.633648, 2002.
DOI : 10.1007/3-540-46135-3_42

L. Perron, Fast restart policies and large neighborhood search