
## 7 Bibliography References

[1] Pascal Van Hentenrych and Laurent Michel (2005): Constraint-based local search. *The MIT Press*.

[2] W. Matthew Carlyle and R. Kevin Wood (2003): Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems. *Proceedings of the 38th Annual ORSNZ Conference*.

[3] J. E. Beasley and N. Christofides (1989): *An Algorithm for the Resource Constrained Shortest Path Problem*.

Network, vol. 19, pp. 379–394.

[4] I. Dumitrescu and N. Boland (2003): *Improved Preprocessing, Labeling and Scaling Algorithms for the* Weight-Constrained Shortest Path Problem. *Networks, 42*, pp. 135–153.

[5] Quang Dung Pham and Yves Deville and Pascal Van Hentenryck (2009): LS(Graph & Tree): A Local Search Framework for Constraint Optimization on Graphs and Trees. *Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC'09)*.

[6] Quang Dung Pham and Yves Deville and Pascal Van Hentenryck: *A Local Search Modeling for Constrained* Optimum Paths Problems. *INGI Technical Report, UCLouvain, Belgique, August 2009*.

[7] M. Blesa and C. Blum (2007): *Finding edge-disjoint paths in networks: An ant colony optimization algorithm*.

Journal of Mathematical Modelling and Algorithms, 6(3), pp. 361–391.