![]() | Up a level |
This 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.
A 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.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2014). An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Computers and Operations Research, 41(1), 167-173. External link
Azi, N., Gendreau, M., & Potvin, J.-Y. (2010). A dynamic vehicle routing problem with multiple delivery routes. (Technical Report n° CIRRELT-2010-44). External link
Azi, N., Gendreau, M., & Potvin, J.-Y. (2010). An adaptive large neighborhood search for a vehicle routing problem with multiple trips. (Technical Report n° CIRRELT-2010-08). External link
Bérubé, J.-F., Gendreau, M., & Potvin, J.-Y. (2007). An exact e-constraint method for bi-objective combinatorial optimization problems - application to the traveling salesman problem with profits. (Working Paper n° CIRRELT-2007-05). External link
Cote, J.-F., Gendreau, M., & Potvin, J.-Y. (2020). The Vehicle Routing Problem with Stochastic Two-Dimensional Items. Transportation Science, 54(2), 453-469. External link
Cimon, Y., Lehoux, N., Trépanier, M., & Potvin, J.-Y. (2017, January). Le CIRRELT au service de la collectivité [Paper]. Atelier de maillage industriel du CRM - Analyse de données, modélisation et aide à la décision, Québec, Canada. Unavailable
Cote, J.-F., Gendreau, M., & Potvin, J.-Y. (2014). An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints. Operations Research, 62(5), 1126-1141. External link
Côté, J.-F., Potvin, J.-Y., & Gendreau, M. (2013). The vehicle routing problem with stochastic two-dimensional items. (Technical Report n° CIRRELT-2013-84). External link
Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2013). An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraint. (Technical Report n° CIRRELT-2013-26). External link
Côté, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2012). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks, 60(4), 212-226. External link
Cote, J.-F., Gendreau, M., & Potvin, J.-Y. (2012). Large Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem With Multiple Stacks. Networks, 60(1), 19-30. External link
Côté, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2010). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. (Technical Report n° CIRRELT-2010-55). External link
Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). Large neighborhood search for the single vehicle pickup and delivery problem with multiple loading stacks. (Technical Report n° CIRRELT-2009-47). External link
Crainic, T. G., Gendreau, M., & Potvin, J.-Y. (2008). Intelligent freight transportation systems: assessment and the contribution of operations research. (Technical Report n° CIRRELT-2008-40). External link
Guillen Reyes, F. O., Potvin, J.-Y., Gendreau, M., & Vidal, T. (2023). Impact of distance data inaccuracies on vehicle routing algorithms: An experimental study. (Annual Report n° CIRRELT-2023-21). External link
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2021). Managing in real-time a vehicle routing plan with time-dependent travel times on a road network. Transportation Research Part C: Emerging Technologies, 132, 15 pages. External link
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2020). Travel speed prediction based on learning methods for home delivery. EURO Journal on Transportation and Logistics, 9(4), 100006 (16 pages). Available
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2020). Tabu search for the time-dependent vehicle routing problem with time windows on a road network. European Journal of Operational Research, 288(1), 129-140. External link
Gendreau, M., & Potvin, J.-Y. (eds.) (2019). Handbook of Metaheuristics. (3rd ed.). External link
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2019). Managing in real-time a vehicle routing plan with time-dependent travel times on a road network. (Technical Report n° CIRRELT-2019-45). External link
Gendreau, M., & Potvin, J.-Y. (2019). Tabu Search. In Handbook of Metaheuristics (3rd ed., Vol. 272, pp. 37-55). External link
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2019). Tabu search for the time-dependent vehicle routing problem with time windows on a road network. (Technical Report n° CIRRELT-2019-32). External link
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2018). Travel speed prediction based on learning methods for home delivery. (Technical Report n° CIRRELT-2018-46). External link
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2018). Travel speed prediction based on learning methods for home delivery. (Technical Report n° DS4DM-2018-012). Unavailable
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2017, October). Travel speed prediction using machine learning techniques [Paper]. ITS World Congress, Montréal, Québec (10 pages). Unavailable
Gendreau, M., & Potvin, J.-Y. (2007). Metaheuristics: a Canadian perspective. (Technical Report n° CIRRELT-2007-60). External link
Gendreau, M., Potvin, J.-Y., Bräysy, O., Hasle, G., & Løkketangen, A. (2007). Metaheuristics for the vehicle routing problem and its extensions : A categorized bibliography. (Working Paper n° CIRRELT-2007-27). External link
Hernandez, F., Gendreau, M., & Potvin, J.-Y. (2017). Heuristics for tactical time slot management: A periodic vehicle routing problem view. International Transactions in Operational Research, 24(6), 1233-1252. External link
Hojabri, H., Gendreau, M., Potvin, J.-Y., & Rousseau, L.-M. (2016). Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints. (Technical Report n° CIRRELT-2016-31). External link
Hernandez, F., Gendreau, M., & Potvin, J.-Y. (2014). Heuristics for time slot management: A periodic vehicle routing problem view. (Technical Report n° CIRRELT-2014-59). External link
Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. (2021). Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem. Operations Research Forum, 2(1). External link
Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. (2021). A metaheuristic based on tabu search for solving a technician routing and scheduling problem. Computers & Operations Research, 125, 8 pages. External link
Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. (2018). A metaheuristic based on tabu search for solving a technician routing and scheduling problem. (Technical Report n° CIRRELT-2018-01). External link
Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. (2018). Mixed integer linear programming for a multi-attribute technician routing and scheduling problem. INFOR, 56(1), 33-49. External link
Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. (2017). Branch-and-price for a multi-attribute technician routing and scheduling problem. (Technical Report n° CIRRELT-2017-56). External link
Minic, S. M., Gendreau, M., Potvin, J.-Y., Berger, J., Boukhtouta, A., & Thomson, D. (2017, December). Military three-echelon disaster relief supply chain management [Paper]. 4th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM 2017), Münster, Germany (8 pages). External link
Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. (2016). Mixed integer programming for a multi-attribute technician routing and scheduling problem. (Technical Report n° CIRRELT-2016-23). External link
Nekooghadirli, N., Gendreau, M., Potvin, J.-Y., & Vidal, T. (2022). Workload equity in multi-period vehicle routing problems. (Technical Report n° CIRRELT-2022-22). External link
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. External link
Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1998). Exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 32(1), 12-29. External link
Reyes, F. O. G., Gendreau, M., & Potvin, J.-Y. (2024). A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network. EURO Journal on Transportation and Logistics, 13, 100143 (20 pages). External link
Reyes, F. O. G., Gendreau, M., & Potvin, J.-Y. (2023). A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network. (Technical Report n° CIRRELT-2023-28). External link
Tagmouti, M., Gendreau, M., & Potvin, J.-Y. (2011). A dynamic capacitated arc routing problem with time-dependent service costs. Transportation Research Part C: Emerging Technologies, 19(1), 20-28. External link
Tagmouti, M., Gendreau, M., & Potvin, J.-Y. (2010). A Variable Neighborhood Descent Heuristic for Arc Routing Problems With Time-Dependent Service Costs. Computers & Industrial Engineering, 59(4), 954-963. External link
Tagmouti, M., Gendreau, M., & Potvin, J.-Y. (2009). A Dynamic Capacitated Arc Routing Problem with Time-Dependent Service Costs. (Technical Report n° CIRRELT-2009-19). External link
Tagmouti, M., Gendreau, M., & Potvin, J.-Y. (2008). A variable neighborhood descent for arc routing problems with time-dependent service costs. (Technical Report n° CIRRELT-2008-27). External link