Documents publiés en "2004"

Azi, N., Gendreau, M., & Potvin, J.-Y. (juin 2004). Vehicle Routing for the Home Delivery of Perishable Products [Communication écrite]. 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (5 pages). Lien externe

Bourbeau, B.̂., Crainic, T. G., Gendreau, M., & Robert, J. (2004). Design for optimized multi-lateral multi-commodity markets. European Journal of Operational Research, 163(2), 503-529. Lien externe

Bräysy, O., Dullaert, W., & Gendreau, M. (2004). Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. Journal of Heuristics, 10(6), 587-611. Lien externe

Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2004). New Heuristics for the Vehicle Routing Problem. (Rapport technique n° G-2004-33). Lien externe

Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 44(3), 216-229. Lien externe

Feillet, D., Gendreau, M., & Rousseau, L.-M. (juin 2004). New Refinements for the Solution of Vehicle Routing Problems with Column Generation [Communication écrite]. 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe. Lien externe

Gabriel Crainic, T., Gendreau, M., Hansen, P., & Mladenović, N. (2004). Cooperative Parallel Variable Neighborhood Search for the p-Median. Journal of Heuristics, 10(3), 293-314. Lien externe

Ghamlouche, I., Crainic, T. G., & Gendreau, M. (2004). Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design. Annals of Operations Research, 131(1-4), 109-133. Lien externe

Le Louarn, F.-X., Gendreau, M., & Potvin, J.-Y. (2004). GENI Ants for the Traveling Salesman Problem. Annals of Operations Research, 131(1-4), 187-201. Lien externe

Rousseau, L.-M., Focacci, F., Gendreau, M., & Pesant, G. (2004). Solving VRPTW with Constraint Programming Based Column Generation. Annals of Operations Research, 130(1-4), 199-216. Lien externe