Documents dont l'auteur est "Laporte, Gilbert"

Réseau de collaboration

Veuillez patienter

Aide

Ce graphique trace les liens entre tous les collaborateurs des publications de {} figurant sur cette page.

Chaque lien représente une collaboration sur la même publication. L'épaisseur du lien représente le nombre de collaborations.

Utilisez la molette de la souris ou les gestes de défilement pour zoomer à l'intérieur du graphique.

Vous pouvez cliquer sur les noeuds et les liens pour les mettre en surbrillance et déplacer les noeuds en les glissant.

Enfoncez la touche "Ctrl" ou la touche "⌘" en cliquant sur les noeuds pour ouvrir la liste des publications de cette personne.

2022

Rostami, B., Chitsaz, M., Arslan, O., Laporte, G., & Lodi, A. (2022). Single Allocation Hub Location with Heterogeneous Economies of Scale. Operations Research, 70(2), 766-785. Lien externe

2020

Vidal, T., Laporte, G., & Matl, P. (2020). A concise guide to existing and emerging vehicle routing problem variants. European Journal of Operational Research, 286(2), 401-416. Lien externe

2017

Gaboune, B., Laporte, G., & Soumis, F. (2017). Expected Distances between Two Uniformly Distributed Random Points in Rectangles and Rectangular Parallelpipeds. Journal of the Operational Research Society, 44(5), 513-519. Lien externe

Palomo-Martinez, P. J., Salazar-Aguilar, M. A., Laporte, G., & Langevin, A. (2017). A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints. Computers & Operations Research, 78, 408-419. Lien externe

Veenstra, M., Cherkesly, M., Desaulniers, G., & Laporte, G. (2017). The pickup and delivery problem with time windows and handling operations. Computers & Operations Research, 77, 127-140. Lien externe

2016

Taş, D., Gendreau, M., Jabali, O., & Laporte, G. (2016). The traveling salesman problem with time-dependent service times. European Journal of Operational Research, 248(2), 372-383. Lien externe

2015

Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Computers and Operations Research, 62, 23-35. Lien externe

2014

Taş, D., Gendreau, M., Jabali, O., & Laporte, G. (2014). The traveling salesman problem with time-dependent service times. (Rapport technique n° CIRRELT-2014-48). Lien externe

Laporte, G., Ropke, S., & Vidal, T. (2014). Heuristics for the Vehicle Routing Problem. Dans Vehicle Routing (p. 87-116). Lien externe

Angelica Salazar-Aguilar, M., Langevin, A., & Laporte, G. (2014). The multi-district team orienteering problem. Computers and Operations Research, 41(1), 76-82. Lien externe

Jabali, O., Rei, W., Gendreau, M., & Laporte, G. (2014). Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. Discrete Applied Mathematics, 177, 121-136. Lien externe

2013

Verma, M., Gendreau, M., & Laporte, G. (2013). Optimal location and capability of oil-spill response facilities for the south coast of Newfoundland. Omega, 41(5), 856-67. Lien externe

Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2013). The synchronized arc and node routing problem: Application to road marking. Computers & Operations Research, 40(7), 1708-1715. Lien externe

2012

Jabali, O., Rei, W., Gendreau, M., & Laporte, G. (2012). New valid inequalities for the multi-vehicle routing problem with stochastic demands. (Rapport technique n° CIRRELT-2012-58). Lien externe

Jabali, O., Gendreau, M., & Laporte, G. (2012). A continuous approximation model for the fleet composition problem. Transportation Research Part B: Methodological, 46(10), 1591-1606. Lien externe

Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2012). Synchronized Arc Routing for Snow Plowing Operations. Computers & Operations Research, 39(7), 1432-1440. Lien externe

2011

Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (juin 2011). An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes [Communication écrite]. 5th International Conference on Network Optimization, INOC 2011, Hamburg, Germany. Lien externe

2010

Gutierrez-Jarpa, G., Desaulniers, G., Laporte, G., & Marianov, V. (2010). A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. European Journal of Operational Research, 206(2), 341-349. Lien externe

2008

Bordenave, C., Gendreau, M., & Laporte, G. (2008). A branch-and-cut algorithm for the non-preemptive swapping problem. (Rapport technique n° CIRRELT-2008-22). Lien externe

Bordenave, C., Gendreau, M., & Laporte, G. (2008). A branch-and-cut algorithm for the preemptive swapping problem. (Rapport technique n° CIRRELT-2008-23). Lien externe

Bordenave, C., Gendreau, M., & Laporte, G. (2008). Heuristics for the mixed swapping problem. (Rapport technique n° CIRRELT-2008-24). Lien externe

2005

Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2005). New heuristics for the vehicle routing problem. Dans Logistics systems : design and optimization (p. 279-297). Lien externe

1988

Desrosiers, J., Laporte, G., Sauvé, M., Soumis, F., & Taillefer, S. (1988). Vehicle routing with full loads. Computers & Operations Research, 15(3), 219-226. Lien externe