 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Angelica Salazar-Aguilar, M., Langevin, A., & Laporte, G. (2014). The multi-district team orienteering problem. Computers and Operations Research, 41(1), 76-82. External link
Anily, S., Gendreau, M., & Laporte, G. (2006). The Preemptive Swapping Problem on a Tree. (Technical Report n° G-2005-69). External link
Alberto Cabral, E., Gendreau, M., Ghiani, G., & Laporte, G. (2003). Solving the hierarchical Chinese postman problem as a rural postman problem. European Journal of Operational Research, 155(1), 44-50. External link
Bordenave, C., Gendreau, M., & Laporte, G. (2008). A branch-and-cut algorithm for the non-preemptive swapping problem. (Technical Report n° CIRRELT-2008-22). External link
Bordenave, C., Gendreau, M., & Laporte, G. (2008). A branch-and-cut algorithm for the preemptive swapping problem. (Technical Report n° CIRRELT-2008-23). External link
Bordenave, C., Gendreau, M., & Laporte, G. (2008). Heuristics for the mixed swapping problem. (Technical Report n° CIRRELT-2008-24). External link
Bourjolly, J.-M., Gaboune, B., Laporte, G., & Soumis, F. (1994). Optimal Policies for Some Discrete Sequencing Problems Arising in Flexible Manufacturing. (Technical Report n° G-93-31). External link
Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2016). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. European Journal of Operational Research, 250(3), 782-793. External link
Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2015). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. (Technical Report n° G-2015-25). External link
Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transportation Science, 49(4), 752-766. External link
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. External link
Cherkesly, M., Desaulniers, G., & Laporte, G. (2014). A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. (Technical Report n° G-2014-66). External link
Cherkesly, M., Desaulniers, G., & Laporte, G. (2013). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and LIFO Loading. (Technical Report n° G-2013-31). External link
Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2005). New heuristics for the vehicle routing problem. In Langevin, A., & Riopel, D. (eds.), Logistics systems : design and optimization (pp. 279-297). External link
Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2004). New Heuristics for the Vehicle Routing Problem. (Technical Report n° G-2004-33). External link
Cabral, E. A., Gendreau, M., Ghiani, G., & Laporte, G. (2002). Solving the Hierarchical Chinese Postman Problem as a Rural Postman Problem. (Technical Report n° G-2001-10). External link
Desrosiers, J., Laporte, G., Sauvé, M., Soumis, F., & Taillefer, S. (1988). Vehicle routing with full loads. Computers & Operations Research, 15(3), 219-226. External link
Desrosiers, J., Laporte, G., Sauvé, M., Soumis, F., & Taillefer, S. (1987). Vehicle Routing with Full Loads. (Technical Report n° G-85-21). External link
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. External link
Gutiérrez-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. External link
Ghiani, G., Hertz, A., & Laporte, G. (2002). Recent algorithmic advances for arc routing problems. In Kozan, E., & Ohuchi, A. (eds.), Operations research/management science at work (Vol. 43, pp. 1-20). External link
Ghiani, G., Hertz, A., & Laporte, G. (2001). Recent Algorithmic Advances for Arc Routing Problems. (Technical Report n° G-2000-40). External link
Gendreau, M., Laporte, G., & Potvin, J.-Y. (1999). Metaheuristics for the Vehicle Routing Problem. (Technical Report n° G-98-52). External link
Gaboune, B., Laporte, G., & Soumis, F. (1994). Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions. International Journal of Flexible Manufacturing Systems, 6(2), 123-135. External link
Gendreau, M., Hertz, A., Laporte, G., & Mihnea, S. (1994, June). Efficient heuristics for traveling salesman and vehicle problems with time windows [Paper]. 2nd Triennal Symposium on Transportation Analysis (Tristan II), Capri, Italy. External link
Gendreau, M., Hertz, A., & Laporte, G. (1994, June). A tabu search heuristic for the vehicle routing problem with backhauls [Paper]. 2nd Triennal Symposium on Transportation Analysis (Tristan II), Capri, Italy. External link
Gaboune, B., Laporte, G., & Soumis, F. (1993). Optimal Tool Partitioning Rules for Numerically Controlled Punch Press Operations. (Technical Report n° G-91-46). External link
Gendreau, M., Hertz, A., & Laporte, G. (1993). A Generalized Insertion Algorithm for the Seriation Problem. (Technical Report n° G-93-29). External link
Gaboune, B., Laporte, G., & Soumis, F. (1992). Optimal Strip Sequencing Strategies for Flexible Manufacturing Operations in Two and Three Dimensions. (Technical Report n° G-92-06). External link
Gaboune, B., Laporte, G., & Soumis, F. (1992). Expected Distances between Two Random Points in Rectangles and Rectangular Parallelepipeds. (Technical Report n° G-91-52). External link
Gendreau, M., Hertz, A., & Laporte, G. (1991). A Tabu Search Heuristic for the Vehicle Routing Problem. (Technical Report n° G-91-31). External link
Gendreau, M., Hertz, A., & Laporte, G. (1991, June). A Tabu Search Heuristic for the Vehicle Routing Problem [Paper]. 1st Triennal Symposium on Transportation Analysis (Tristan I), Montréal, Québec. External link
Hertz, A., Laporte, G., Mittaz, M., & Stecke, K. E. (1997). Heuristics for Minimizing Tool Switches when Scheduling Part Types on a Flexible Machine. (Technical Report n° G-97-03). External link
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. External link
Jabali, O., Rei, W., Gendreau, M., & Laporte, G. (2012). New valid inequalities for the multi-vehicle routing problem with stochastic demands. (Technical Report n° CIRRELT-2012-58). External link
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. External link
Laporte, G., Ropke, S., & Vidal, T. (2014). Heuristics for the Vehicle Routing Problem. In Vehicle Routing (pp. 87-116). External link
Laporte, G., Gendreau, M., Potvin, J.-Y., & Semet, F. (1999). Classical and Modern Heuristics for the Vehicle Routing Problem. (Technical Report n° G-99-21). External link
Laporte, G., Lopes, L., & Soumis, F. (1998). Optimal Sequencing Rules for Some Large-Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics. International Journal of Flexible Manufacturing Systems, 10(1), 27-42. External link
Laporte, G., Lopes, L., & Soumis, F. (1997). Optimal Sequencing Rules for Some Large Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics. (Technical Report n° G-95-26). External link
Laporte, G., Lopes, L., & Soumis, F. (1995). Optimal Sequencing Rules for Some Large Scale Flexible Manufacturing Problems Under Four Different Metrics. (Technical Report n° G-95-25). External link
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. External link
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. External link
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. External link
Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2012). Synchronized Arc Routing for Snow Plowing Operations. Computers & Operations Research, 39(7), 1432-1440. External link
Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2011, June). An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes [Paper]. 5th International Conference on Network Optimization, INOC 2011, Hamburg, Germany. External link
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. External link
Taş, D., Gendreau, M., Jabali, O., & Laporte, G. (2014). The traveling salesman problem with time-dependent service times. (Technical Report n° CIRRELT-2014-48). External link
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. External link
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. External link
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. External link
