Documents publiés en "1999"

A

Andresol, R., Gendreau, M., & Potvin, J.-Y. (1999). A Hopfield-Tank Neural Network Model for the Generalized Traveling Salesman Problem. Dans Voß, S., Martello, S., Osman, I. H., & Roucairol, C. (édit.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (p. 393-402). Lien externe

Anily, S., Gendreau, M., & Laporte, G. (1999). The Swapping Problem on a Line. SIAM Journal on Computing, 29(1), 327-335. Lien externe

C

Crainic, T. G., & Gendreau, M. (1999). Towards an Evolutionary Method — Cooperating Multi-Thread Parallel Tabu Search Hybrid. Dans Voß, S., Martello, S., Osman, I. H., & Roucairol, C. (édit.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (p. 331-344). Lien externe

G

Gendreau, M., Laporte, G., & Potvin, J.-Y. (1999). Metaheuristics for the Vehicle Routing Problem. (Rapport technique n° G-98-52). Lien externe

Gendreau, M., Laporte, G., & Vigo, D. (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers & Operations Research, 26(7), 699-714. Lien externe

Gendreau, M., Laporte, G., Musaraganyi, C., & Taillard, É. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26(12), 1153-1173. Lien externe

Gendreau, M., Larochelle, J.-F., & Sanso, B. (1999). A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34(2), 162-172. Lien externe

L

Laporte, G., Gendreau, M., Potvin, J.-Y., & Semet, F. (1999). Classical and Modern Heuristics for the Vehicle Routing Problem. (Rapport technique n° G-99-21). Lien externe

N

Nour, M., Gendreau, M., & Atwood, J. W. (septembre 1999). Network performance-based connection admission control model in ATM networks: unicast and multicast [Communication écrite]. Photonics East 1999, Boston, MA, USA. Publié dans Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE, 3842. Lien externe

Nour, M., Hafid, A., & Gendreau, M. (juin 1999). Networks performance based connection admission control model in ATM networks: immediate and future reservation approaches [Communication écrite]. 2nd International Conference on ATM (ICATM 1999), Colmar, France. Lien externe

P

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

R

Rousseau, L.-M., Gendreau, M., & Pesant, G. (juin 1999). Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules [Communication écrite]. 8es Journées francophones de programmation logique et programmation par contraintes (JFPLC 1999), Lyon, France. Non disponible

Rousseau, L.-M., Gendreau, M., & Pesant, G. (janvier 1999). Using constraint-based operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows [Communication écrite]. 1st Workshop on Integration of AI and OR Techniques in constraint Programming for Combinatorial Optimization Problems. Non disponible

S

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 (p. 147-167). Lien externe