 | Monter d'un niveau |
Gendreau, M., Larochelle, J.-F., & Sanso, B. (1999). A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34(2), 162-172. Lien externe
Pesant, G., & Gendreau, M. (1999). A constraint programming framework for local search methods. Journal of Heuristics, 5(3), 255-279. Lien externe
Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1999). On the Flexibility of constraints programming models: from single to multiple time windows for the traveling salesman problem. European Journal of Operational Research, 117(2), 253-263. Lien externe
Soriano, P., Wynants, C., Séguin, R., Labbé, M., Gendreau, M., & Fortz, B. (1999). Design and Dimensioning of Survivable SDH/Sonet Networks. Dans Telecommunications Network Planning (147-167). Lien externe
