Jean-François
Côté

Publications

Articles

• Parada, L., Côté, J.-F., & Gendreau, M. (2026). A disaggregated integer L-shaped method for the bike sharing rebalancing problem with stochastic demands. European Journal of Operational Research, 329(2), 436-446. DOI : 10.1016/j.ejor.2025.07.041
• Tang, L., Li, Y., Liu, K., Côté, J.-F., & C. Coelho, L. (2026). Novel models and efficient heuristic for the vessel-unmanned surface vehicle routing problem. Computers & Operations Research, 189, 107384. DOI : 10.1016/j.cor.2026.107384
• Parada, L., Côté, J.-F., & Gendreau, M. (2026). Service level requirements for real life–sized bicycle sharing systems. Transportation Science. DOI : 10.1287/trsc.2024.1010
• Ali, N. W. O., Côté, J.-F., & C. Coelho, L. (2025). Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty. Computers & Operations Research, 183, 107198. DOI : 10.1016/j.cor.2025.107198
• Li, Y., Zhou, S., & Côté, J.-F. (2025). Exact methods and a two-stage iterative heuristic for the carrier-vehicle traveling salesman problem. INFORMS Journal on Computing. DOI : 10.1287/ijoc.2025.1140
• Guo, X., Côté, J.-F., Zhang, C., & Miao, L. (2025). A logic-based benders decomposition for the car resequencing problem with a painted body storage. INFORMS Journal on Computing. DOI : 10.1287/ijoc.2024.0904
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2025). Personnel scheduling problem for ready-mixed concerte delivery. Expert Systems with Applications, 266, 125915. DOI : 10.1016/j.eswa.2024.125915
• Ali, N. W. O., Côté, J.-F., & C. Coelho, L. (2024). A GRASP algorithm for the concrete delivery problem. Computers & Operations Research, 172, 106818. DOI : 10.1016/j.cor.2024.106818
• Parada, L., Legault, R., Côté, J.-F., & Gendreau, M. (2024). A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse. European Journal of Operational Research, 318(2), 520-533. DOI : 10.1016/j.ejor.2024.05.012
• Côté, J.-F., Mansini, R., & Raffaele, A. (2024). Multi-period time window assignment for attended home delivery. European Journal of Operational Research, 316(1), 295-309. DOI : 10.1016/j.ejor.2024.01.021
• Bonomi, V., Côté, J.-F., Mansini, R., & Zanotti, R. (2024). Dynamically dealing with requests in a stochastic multi-period home healthcare problem with consistency constraints. International Journal of Production Research, 63(11), 4137-4162. DOI : 10.1080/00207543.2024.2436652
• Côté, J.-F., De Queiroz, T. A., Gallesi, F., & Iori, M. (2023). A branch-and-regret algorithm for the same-day delivery problem. Transportation Research Part E: Logistics and Transportation Review, 177, 103226. DOI : 10.1016/j.tre.2023.103226
• Li, Y., Côté, J.-F., C. Coelho, L., Zhang, C., & Zhang, S. (2023). Order assignment and scheduling under processing and distribution time uncertainty. European Journal of Operational Research, 305(1), 148-163. DOI : 10.1016/j.ejor.2022.05.033
• Legault, R., Côté, J.-F., & Gendron, B. (2023). A novel reformulation for the single-sink fixed-charge transportation problem. Mathematical Programming, 202, 169-198. DOI : 10.1007/s10107-023-01930-y
• Lalonde, O., Côté, J.-F., & Gendron, B. (2022). A Branch-and-Price Algorithm for the Multiple Knapsack Problem. INFORMS Journal on Computing, 34(6), 3134-3150. DOI : 10.1287/ijoc.2022.1223
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2022). Fleet sizing and routing of healthcare automated guided vehicles. Transportation Research Part E: Logistics and Transportation Review, 161, 102679. DOI : 10.1016/j.tre.2022.102679
• Li, Y., Côté, J.-F., C. Coelho, L., & Wu, P. (2022). Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem. INFORMS Journal on Computing, 34(2), 1048-1069. DOI : 10.1287/ijoc.2021.1113
• Li, Y., Côté, J.-F., C. Coelho, L., & Wu, P. (2022). Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates. International Journal of Production Research, 60(20), 6104-6123. DOI : 10.1080/00207543.2021.1983224
• Guastaroba, G., Côté, J.-F., & C. Coelho, L. (2021). The multi-period workforce scheduling and routing problem. Omega, 102, 102302. DOI : 10.1016/j.omega.2020.102302
• Ali, N. W. O., Côté, J.-F., & C. Coelho, L. (2021). Models and algorithms for the delivery and installation routing problem. European Journal of Operational Research, 291(1), 162-177. DOI : 10.1016/j.ejor.2020.09.011
• Côté, J.-F., Haouari, M., & Iori, M. (2021). Combinatorial benders decomposition for the two-dimensional bin packing problem. INFORMS Journal on Computing, 33(3), 963-978. DOI : 10.1287/ijoc.2020.1014
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2020). Exact algorithms for the multi-pickup and delivery problem with time windows. European Journal of Operational Research, 284(3), 906-919. DOI : 10.1016/j.ejor.2020.01.040
• Li, Y., Chu, F., Côté, J.-F., C. Coelho, L., & Chu, C. (2020). The multi-plant perishable food production routing with packaging consideration. International Journal of Production Economics, 221, 107472. DOI : 10.1016/j.ijpe.2019.08.007
• Côté, J.-F., Gendreau, M., & Potvin, J.-Y. (2020). The vehicle routing problem with stochastic two-dimensional items. Transportation Science, 54(2), 299-564. DOI : 10.1287/trsc.2019.0904
• Chabot, T., C. Coelho, L., Renaud, J., & Côté, J.-F. (2018). Mathematical model, heuristics and exact method for order picking in narrow aisles. Journal of the Operational Research Society, 69(8), 1242-1253. DOI : 10.1080/01605682.2017.1390532
• Naccache, S., Côté, J.-F., & C. Coelho, L. (2018). The multi-pickup and delivery problem with time windows. European Journal of Operational Research, 269(1), 353-362. DOI : 10.1016/j.ejor.2018.01.035
• Côté, J.-F., & Iori, M. (2018). The Meet-in-the-Middle Principle for Cutting and Packing Problems. INFORMS Journal on Computing, 30(4), 646-661. DOI : 10.1287/ijoc.2018.0806
• Côté, J.-F., Guastaroba, G., & Speranza, M. (2017). The value of integrating loading and routing. European Journal of Operational Research, 257(1), 89-105. DOI : 10.1016/j.ejor.2016.06.072
• Côté, 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. DOI : 10.1287/opre.2014.1307
• Côté, J.-F., Dell'amico, M., & Iori, M. (2014). Combinatorial Benders' Cuts for the Strip Packing Problem. Operations Research, 62(3), 643-661. DOI : 10.1287/opre.2013.1248
• 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. DOI : 10.1002/net.21459
• Côté, 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. DOI : 10.1002/net.20448
• Côté, J.-F., & Potvin, J. Y. (2009). A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research, 198(2), 464-469. DOI : 10.1016/j.ejor.2008.09.009

Chapitres d'un ouvrage collectif

• Côté, J.-F., Gallesi, F., Iori, M., & De Queiroz, T. A. (2019). Optimization Methods for the Same-Day Delivery Problem. Advances in Optimization and Decision Science for Society, Services and Enterprises (pp. 335-349). doi : 10.1007/978-3-030-34960-8_30.

Communications dans une conférence avec actes

• Martinovic, J., Strasdat, N., Côté, J.-F., & Loti De Lima, V. (2023). A heuristic column generation approach for the stochastic bin packing problem. Operations Research Proceedings 2022, Karlsruhe, Allemagne.
• Côté, J.-F. (2022). A new integer L-shaped method for the stochastic vehicle routing problem. JOPT.
• Ali, N. W. O., Côté, J.-F., & C. Coelho, L. (2021). Robust algorithms for the two-echelon location routing problem under demand uncertainty. EURO 2021 Athens, Athènes, Grèce.
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2021). Fleet sizing and routing problem with synchronization for AGVs with dynamic demands. EURO 2021 Athens, Athènes, Grèce.
• Côté, J.-F. (2018). A Computational Study on Methods to Compare the Offer of Time Windows in Attended Home Delivery. EURO / ALIO 2018, Bologne, Italie.
• Côté, J.-F. (2018). A Computational Study on Methods to Compare the Offer of Time Windows in Attended Home Delivery. JOPT 2018, Canada.

Communications dans une conférence sans actes

• Côté, J.-F. (2025). The integer L-shaped method for the vehicle routing problem with stochastic demands. Journées de l'Optimisation, Montréal, Canada.
• Côté, J.-F. (2025). An exact algorithm for small orthogonal packing problems. ESICUP, Bordeaux, France.
• Côté, J.-F. (2022). A new integer L-shaped method for the stochastic vehicle routing problem. CORS.
• Côté, J.-F. (2021). Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem. EURO, Athènes, Grèce.
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2021). Fleet sizing and routing problem with synchronization for AGVs with dynamic demands. CORS Annual Conference.
• Côté, J.-F., Alves De Queiroz, T., Gallesi, F., & Iori, M. (2021). Dynamic Optimization Algorithms for Same-Day Delivery Problems. MobilOpt, Québec, Canada.
• Côté, J.-F. (2021). The Meet-in-the-Middle Principle for Cutting and Packing Problems. ESICUP.
• Côté, J.-F. (2019). A study on time window offerings in attended home delivery. VeRoLog, Seville, Espagne.
• Ali, N. W. O., Côté, J.-F., & C. Coelho, L. (2019). The delivery and installation routing problem. Optimization Days, Montréal, Canada.
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2019). The multi-pickup and delivery routing problem. Optimization Days, Montréal, Canada.
• Côté, J.-F. (2017). The Stochastic Multi-Period Time Windows Assignment Problem. 21st Conference of the International Federation of Operational Research Societies (IFORS 2017), Québec, Canada.
• Côté, J.-F. (2017). The Stochastic Multi-Period Time Windows Assignment Problem. Optimization Days 2017, Montréal, Canada.
• Côté, J.-F. (2016). The Stochastic Multi-Period Time Windows Assignment Problem. Clear Destination, Montréal, Canada.
• Côté, J.-F. (2016). The Stochastic Multi-Period Time Windows Assignment Problem. Université de Modène et Reggio Emilia, Italie.
• Côté, J.-F. (2016). The Stochastic Multi-Period Time Windows Assignment Problem. Annual Workshop of the EURO Working Group on Vehicle Routing and Logistics Optimization (VeRoLog 2016), Nantes, France.
• Côté, J.-F. (2016). The Stochastic Multi-Period Time Windows Assignment Problem. 58th CORS Annual Conference (CORS 2016), Banff, Canada.
• Côté, J.-F. (2016). The Meet-in-the-Middle Principle for Cutting and Packing Problems. 2016 Optimization Days, Montréal, Canada.
• Côté, J.-F., & C. Coelho, L. (2015). A Parallel Heuristic for the Two-Dimensional Capacited Vehicle Routing Problem. 4th Meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization (VeRoLog 2015), Vienna, Autriche.
• Côté, J.-F. (2015). The Meet-in-the-Middle Principle for Cutting and Packing Problems. 2015 Network Optimization Worshop (NOW 2015), La Rochelle, France.
• Côté, J.-F. (2014). An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem With Unloading Constraints. The 9th International Colloquium on Graphs and Optimization 2014 (GO IX 2014), Sirmione, Italie.
• Côté, J.-F. (2014). The Vehicle Routing Problem With Stochastic Two-Dimensional Items. The 20th Conference of the International Federation of Operational Research Societies, Barcelona, Espagne.
• Côté, J.-F. (2014). The Vehicle Routing Problem With Stochastic Two-Dimensional Items. Optimization Days 2014, Montréal, Canada.
• Côté, J.-F. (2012). An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem With Unloading Constraints. Euro Summer Institute 2012, Porto, Portugal.
• Côté, J.-F. (2011). A Branch-And-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem With Multiple Stacks. 2011 Optimization Days, Montréal, Canada.
• Côté, J.-F. (2009). An Effective Heuristic for the Pickup and Delivery Traveling Salesman Problem With LIFO Loading and Multiple Stacks. 2009 Optimization Days, Montréal, Canada.

Document de travail

• Jodiawan, P., Côté, J.-F., & C. Coelho, L. (2024). The flexible park-and-loop routing problem. CIRRELT Working Paper Series.
• Parada, L., Côté, J.-F., & Gendreau, M. (2024). An integer L-shaped method for the static stochastic bicycle repositioning problem. CIRRELT Working Paper Series.
• Aziez, I., Torkhani, M. Z., Côté, J.-F., Landa, P., & C. Coelho, L. (2023). Healthcare dynamic and stochastic transportation. CIRRELT Working Paper Series.
• Parada, L., Legault, R., Côté, J.-F., & Gendreau, M. (2023). The disaggregated integer L-shaped method for the stochastic vehicle routing problem. CIRRELT Working Paper Series.
• Legault, R., Côté, J.-F., & Gendron, B. (2022). A Novel Reformulation for the Single-Sink Fixed-Charge Transportation Problem. CIRRELT Working Paper Series.
• Lalonde, O., Côté, J.-F., & Gendron, B. (2021). A branch-and-price algorithm for the multiple knapsack problem. CIRRELT Working Paper Series.
• Côté, J.-F., Alves De Queiroz, T., Gallesi, F., & Iori, M. (2021). Dynamic optimization algorithms for same-day delivery problems. CIRRELT Working Paper Series.
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2021). Fleet Sizing of Healthcare Automated Guided Vehicules. CIRRELT Working Paper Series.
• Guastaroba, G., Côté, J.-F., & C. Coelho, L. (2019). The multi-period workforce scheduling and routing problem. CIRRELT Working Paper Series.
• Ali, N. W. O., Côté, J.-F., & C. Coelho, L. (2019). The delivery and installation routing problem. CIRRELT Working Paper Series.
• Côté, J.-F., Haouari, M., & Iori, M. (2019). A primal decomposition algorithm for the two-dimensional bin packing problem. CIRRELT Working Paper Series.
• Côté, J.-F., Mansini, R., & Raffaele, A. (2019). Tactical time window management in attended home delivery. CIRRELT Working Paper Series.
• Aziez, I., Côté, J.-F., & C. Coelho, L. (2019). A branch-and-cut algorithm for the multi-pickup and delivery problem with the time windows. CIRRELT Working Paper Series.
• Côté, J.-F., Haouari, M., & Iori, M. (2019). A primal decomposition algorithm for the two-dimensional bin packing problem. CIRRELT Working Paper Series.
• Naccache, S., Côté, J.-F., & C. Coelho, L. (2017). An Adaptive Large Neighborhood Search for the Multi-Pickup and Delivery Problem with Time Windows. CIRRELT Working Paper Series.
• Côté, J.-F., & Iori, M. (2016). The Meet-in-the-Middle Principle for Cutting and Packing Problems. CIRRELT Working Paper Series.
• Chabot, T., C. Coelho, L., Renaud, J., & Côté, J.-F. (2015). Mathematical Models, Heuristics and Exact Method for Order Picking in 3D-Narrow Aisles. CIRRELT Working Paper Series.
• Côté, J.-F., Guastaroba, G., & Speranza, M. G. (2015). The Value of Integrating Loading and Routing. CIRRELT Working Paper Series.

Activités de recherche en cours

Titre de l'activité	Chercheur(s)	Organisme subventionnaire	Programme	Dates
Méthodes d'optimisation pour la planification des transports et de la mobilité	Principal Jean-François Côté	Conseil de recherches en sciences naturelles et génie Canada	Subventions à la découverte SD (individuelles et d'équipe)	2026-04-01 au 2031-03-31
Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty	Principal Jean-François Côté	Université Laval - Fonds internes	Soutien à la recherche (SAR) FSA - Volet 13 : Valorisation de la publication dans des revues classées A et B	2025-07-17 au 2026-04-30
The flexible park-and-loop routing problem	Principal Jean-François Côté	Université Laval - Fonds internes	Soutien à la recherche (SAR) FSA - Volet 13 : Valorisation de la publication dans des revues classées A et B	2025-07-17 au 2026-04-30
Optimisation de la mobilité urbaine des personnes et des marchandises	Principal Jacques Renaud Autres chercheurs	Fonds de recherche du Québec - Nature et technologies	Projet de recherche en équipe	2024-04-01 au 2027-03-31

Encadrement étudiant

Maîtrise avec mémoire

• Directeur de recherche
  • Omar Abida (Hiver 2024 - Hiver 2026)
  • Jacquelin Marc Octave (Hiver 2023 - Automne 2024)
  • Oumaima Chaabani (Été 2022 - Automne 2023)
  • Mohamed Zied Torkhani (Hiver 2020 - Hiver 2022)
  • Etienne Chanca (Hiver 2018 - Automne 2019)
  • Joseph Robitaille (Hiver 2018 - Automne 2019)
  • Ousmane Ali (Hiver 2017 - Hiver 2019)
  • Ranya El Byaz (Automne 2016 - Été 2018)

Doctorat

• Directeur de recherche
  • Joseph Robitaille (Automne 2018 - ...)
  • Maryam Moshabaki Esfahani (Hiver 2024 - ...)
  • Razieh Mousavi (Automne 2022 - ...)
  • Ousmane Ali (Hiver 2018 - Été 2024)
• Codirecteur de recherche
  • Imadeddine Aziez (Hiver 2022 - Été 2023)

Contribution à l'avancement de la discipline

Participation à des comités d'évaluation

• Computers and Operations Research (2024 - 2025)
• European Journal of Operational Research (2024 - 2025)
• Journal of Scheduling (2024 - 2025)
• Mathematical Methods of Operations Research (2024 - 2025)
• INFORMS Journal on Computing (2024 - 2025)

Implications universitaires et facultaires

Faculté

• Membre du Conseil facultaire FSA (2022 - 2026)
• Membre de l'assemblée du Département d'opérations et systèmes de décision (2014 - ...)

Prix et distinctions

Bourses

• Bourse de doctorat en recherche, Fonds de recherche du Québec - Société et Culture (B2) (2012)
• Bourse de stage de recherche à l’étranger, Fonds de recherche du Québec - Société et Culture (2010)
• Bourse CRSNG de premier cycle pour un stage de recherche
  • (2007)
  • (2006)

Prix et distinctions

• Médaille de la recherche
  • (2023 - 2024)
  • (2022 - 2023)
  • (2021 - 2022)
  • (2021)
  • (2020 - 2021)
  • (2019)
• Best paper award pour l'article « The Multi-Period Workforce Scheduling and Routing Problem » publié dans la revue OMEGA, volume 102, juillet 2021, 102302, avec G. Guastaroba et L. C. Coelho (2021)
• Premier prix du Concours sur la pratique de la Recherche Opérationnelle avec Imadeddine Aziez et Leandro C. Coelho pour l'article « Fleet sizing and routing problem with synchronization for AVGs with dynamic demands », Société Canadienne de Recherche Opérationnelle (SCRO) (2021)
• Distinction Socrate (2016 - 2017)