 | Monter d'un niveau |
Gendreau, M. (2001). Recent Advances in Tabu Search. Dans Ribeiro, C. C., & Hansen, P. (édit.), Essays and Surveys in Metaheuristics (p. 369-377). Lien externe
Gendreau, M., Laporte, G., & Morais Guimarães, E. (2001). A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research, 133(1), 183-189. Lien externe
Gendreau, M., Laporte, G., & Semet, F. (2001). A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Computing, 27(12), 1641-1653. Lien externe
Rousseau, L.-M., Pesant, G., & Gendreau, M. (janvier 2001). Building negative reduced cost paths using constraint programming [Communication écrite]. 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos. Lien externe
Taillard, É. D., Nava, M., Gendreau, M., & Potvin, J.-Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135(1), 16 pages. Lien externe
