A tabu search heuristic for periodic and multi-depot vehicle routing problems. - Jean-François Cordeau; Michel Gendreau; Gilbert Laporte (Networks, 1997)

Scheduling linen deliveries in a large hospital. - M. Banerjea-Brodeur; Jean-François Cordeau; Gilbert Laporte; A. Lasry (J. Oper. Res. Soc., 1998)

A Survey of Optimization Models for Train Routing and Scheduling. - Jean-François Cordeau; Paolo Toth; Daniele Vigo (Transp. Sci., 1998)

Close-Point Spatial Tests and Their Application to Random Number Generators. - Pierre L'Ecuyer; Jean-François Cordeau; Richard J. Simard (Oper. Res., 2000)

A Benders Decomposition Approach for the Locomotive and Car Assignment Problem. - Jean-François Cordeau; François Soumis; Jacques Desrosiers (Transp. Sci., 2000)

Simultaneous Assignment of Locomotives and Cars to Passenger Trains. - Jean-François Cordeau; François Soumis; Jacques Desrosiers (Oper. Res., 2001)

A unified tabu search heuristic for vehicle routing problems with time windows. - Jean-François Cordeau; Gilbert Laporte; Anne Mercier (J. Oper. Res. Soc., 2001)

Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling. - Jean-François Cordeau; Goran Stojkovic; François Soumis; Jacques Desrosiers (Transp. Sci., 2001)

VRP with Time Windows. - Jean-François Cordeau; Guy Desaulniers; Jacques Desrosiers; Marius M. Solomon; François Soumis (The Vehicle Routing Problem, 2002)

A guide to vehicle routing heuristics. - Jean-François Cordeau; Michel Gendreau; Gilbert Laporte; Jean-Yves Potvin; Frédéric Semet (J. Oper. Res. Soc., 2002)

The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. - Jean-François Cordeau; Gilbert Laporte (4OR, 2003)

Using Benders Decomposition to Implicitly Model Tour Scheduling. - Monia Rekik; Jean-François Cordeau; François Soumis (Ann. Oper. Res., 2004)

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. - Jean-François Cordeau; Gilbert Laporte; Anne Mercier (J. Oper. Res. Soc., 2004)

Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. - Andrea Attanasio; Jean-François Cordeau; Gianpaolo Ghiani; Gilbert Laporte (Parallel Comput., 2004)

A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. - Anne Mercier; Jean-François Cordeau; François Soumis (Comput. Oper. Res., 2005)

Maximizing the value of an Earth observation satellite orbit. - Jean-François Cordeau; Gilbert Laporte (J. Oper. Res. Soc., 2005)

Models and Tabu Search Heuristics for the Berth-Allocation Problem. - Jean-François Cordeau; Gilbert Laporte; Pasquale Legato; Luigi Moccia (Transp. Sci., 2005)

An integrated model for logistics network design. - Jean-François Cordeau; Federico Pasin; Marius M. Solomon (Ann. Oper. Res., 2006)

A Memetic Heuristic for the Generalized Quadratic Assignment Problem. - Jean-François Cordeau; Manlio Gaudioso; Gilbert Laporte; Luigi Moccia (INFORMS J. Comput., 2006)

A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. - Jean-François Cordeau (Oper. Res., 2006)

Chapter 7 Transportation on Demand. - Jean-François Cordeau; Gilbert Laporte; Jean-Yves Potvin; Martin W. P. Savelsbergh (Transportation, 2007)

Chapter 6 Vehicle Routing. - Jean-François Cordeau; Gilbert Laporte; Martin W. P. Savelsbergh; Daniele Vigo (Transportation, 2007)

The dial-a-ride problem: models and algorithms. - Jean-François Cordeau; Gilbert Laporte (Ann. Oper. Res., 2007)

A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. - Nicola Bianchessi; Jean-François Cordeau; Jacques Desrosiers; Gilbert Laporte; Vincent Raymond (Eur. J. Oper. Res., 2007)

The service allocation problem at the Gioia Tauro Maritime Terminal. - Jean-François Cordeau; Manlio Gaudioso; Gilbert Laporte; Luigi Moccia (Eur. J. Oper. Res., 2007)

The multi-depot vehicle routing problem with inter-depot routes. - Benoit Crevier; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2007)

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading. - Francesco Carrabs; Raffaele Cerulli; Jean-François Cordeau (INFOR Inf. Syst. Oper. Res., 2007)

Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique. - Ghislain Dubuc; Jean-François Cordeau; Gilbert Laporte; Tolga Bektas (INFOR Inf. Syst. Oper. Res., 2007)

Étude comparative de divers modèles pour le problème de transport à la demande. - Julie Paquette; Jean-François Cordeau; Gilbert Laporte (INFOR Inf. Syst. Oper. Res., 2007)

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. - Francesco Carrabs; Jean-François Cordeau; Gilbert Laporte (INFORMS J. Comput., 2007)

Models and branch-and-cut algorithms for pickup and delivery problems with time windows. - Stefan Ropke; Jean-François Cordeau; Gilbert Laporte (Networks, 2007)

A tabu search heuristic for the quay crane scheduling problem. - Marcello Sammarra; Jean-François Cordeau; Gilbert Laporte; Maria Flavia Monaco (J. Sched., 2007)

Exact algorithms for the joint object placement and request routing problem in content distribution networks. - Tolga Bektas; Jean-François Cordeau; Erhan Erkut; Gilbert Laporte (Comput. Oper. Res., 2008)

A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times. - Gabriella Stecco; Jean-François Cordeau; Elena Moretti (Comput. Oper. Res., 2008)

Iterated tabu search for the car sequencing problem. - Jean-François Cordeau; Gilbert Laporte; Federico Pasin (Eur. J. Oper. Res., 2008)

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. - Alysson M. Costa; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2008)

A tabu search heuristic for the generalized minimum spanning tree problem. - Temel Öncan; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2008)

A two-level simulated annealing algorithm for efficient dissemination of electronic content. - Tolga Bektas; Jean-François Cordeau; Erhan Erkut; Gilbert Laporte (J. Oper. Res. Soc., 2008)

Solution approaches to large shift scheduling problems. - Monia Rekik; Jean-François Cordeau; François Soumis (RAIRO Oper. Res., 2008)

Quality of service in dial-a-ride operations. - Julie Paquette; Jean-François Cordeau; Gilbert Laporte (Comput. Ind. Eng., 2009)

Benders, metric and cutset inequalities for multicommodity capacitated network design. - Alysson M. Costa; Jean-François Cordeau; Bernard Gendron (Comput. Optim. Appl., 2009)

The pickup and delivery traveling salesman problem with first-in-first-out loading. - Günes Erdogan; Jean-François Cordeau; Gilbert Laporte (Comput. Oper. Res., 2009)

A column generation heuristic for a dynamic generalized assignment problem. - Luigi Moccia; Jean-François Cordeau; Maria Flavia Monaco; Marcello Sammarra (Comput. Oper. Res., 2009)

Locating Satellite Yards in Forestry Operations. - Tuyva Chan; Jean-François Cordeau; Gilbert Laporte (INFOR Inf. Syst. Oper. Res., 2009)

Accelerating Benders Decomposition by Local Branching. - Walter Rei; Jean-François Cordeau; Michel Gendreau; Patrick Soriano (INFORMS J. Comput., 2009)

Vehicle routing with cross-docking. - Min Wen; Jesper Larsen; Jens Clausen; Jean-François Cordeau; Gilbert Laporte (J. Oper. Res. Soc., 2009)

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. - Alysson M. Costa; Jean-François Cordeau; Gilbert Laporte (Networks, 2009)

A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine. - Gabriella Stecco; Jean-François Cordeau; Elena Moretti (J. Sched., 2009)

Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. - Stefan Ropke; Jean-François Cordeau (Transp. Sci., 2009)

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. - Jean-François Cordeau; Mauro Dell'Amico; Manuel Iori (Comput. Oper. Res., 2010)

The dynamic multi-period vehicle routing problem. - Min Wen; Jean-François Cordeau; Gilbert Laporte; Jesper Larsen (Comput. Oper. Res., 2010)

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. - Günes Erdogan; Jean-François Cordeau; Gilbert Laporte (Discret. Appl. Math., 2010)

The Delivery Man Problem with time windows. - Géraldine Heilporn; Jean-François Cordeau; Gilbert Laporte (Discret. Optim., 2010)

Dynamic pickup and delivery problems. - Gerardo Berbeglia; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2010)

The Attractive Traveling Salesman Problem. - Günes Erdogan; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2010)

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. - Irina Dumitrescu; Stefan Ropke; Jean-François Cordeau; Gilbert Laporte (Math. Program., 2010)

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. - Jean-François Cordeau; Manuel Iori; Gilbert Laporte; Juan José Salazar González (Networks, 2010)

Scheduling technicians and tasks in a telecommunications company. - Jean-François Cordeau; Gilbert Laporte; Federico Pasin; Stefan Ropke (J. Sched., 2010)

Implicit shift scheduling with multiple breaks and work stretch duration restrictions. - Monia Rekik; Jean-François Cordeau; François Soumis (J. Sched., 2010)

Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search. - Mirko Maischberger; Jean-François Cordeau (INOC, 2011)

A large neighbourhood search heuristic for the aircraft and passenger recovery problem. - Serge Bisaillon; Jean-François Cordeau; Gilbert Laporte; Federico Pasin (4OR, 2011)

An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. - Géraldine Heilporn; Jean-François Cordeau; Gilbert Laporte (Discret. Appl. Math., 2011)

Stochastic uncapacitated hub location. - Iván A. Contreras; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2011)

Optimizing yard assignment in an automotive transshipment terminal. - Jean-François Cordeau; Gilbert Laporte; Luigi Moccia; Gregorio Sorrentino (Eur. J. Oper. Res., 2011)

Benders Decomposition for Large-Scale Uncapacitated Hub Location. - Iván A. Contreras; Jean-François Cordeau; Gilbert Laporte (Oper. Res., 2011)

Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. - Luigi Moccia; Jean-François Cordeau; Gilbert Laporte; Stefan Ropke; Maria Pia Valentini (Networks, 2011)

The Dynamic Uncapacitated Hub Location Problem. - Iván A. Contreras; Jean-François Cordeau; Gilbert Laporte (Transp. Sci., 2011)

The inventory-routing problem with transshipment. - Leandro C. Coelho; Jean-François Cordeau; Gilbert Laporte (Comput. Oper. Res., 2012)

A parallel iterated tabu search heuristic for vehicle routing problems. - Jean-François Cordeau; Mirko Maischberger (Comput. Oper. Res., 2012)

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. - Vera C. Hemmelmayr; Jean-François Cordeau; Teodor Gabriel Crainic (Comput. Oper. Res., 2012)

A branch-price-and-cut method for a ship routing and scheduling problem with split loads. - Magnus Stålhane; Henrik Andersson 001; Marielle Christiansen; Jean-François Cordeau; Guy Desaulniers (Comput. Oper. Res., 2012)

A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. - Gerardo Berbeglia; Jean-François Cordeau; Gilbert Laporte (INFORMS J. Comput., 2012)

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. - Luigi Moccia; Jean-François Cordeau; Gilbert Laporte (J. Oper. Res. Soc., 2012)

Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. - Sophie N. Parragh; Jean-François Cordeau; Karl F. Doerner; Richard F. Hartl (OR Spectr., 2012)

Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. - Iván A. Contreras; Jean-François Cordeau; Gilbert Laporte (Transp. Sci., 2012)

Robust Inventory Routing Under Demand Uncertainty. - Oguz Solyali; Jean-François Cordeau; Gilbert Laporte (Transp. Sci., 2012)

Heuristics for dynamic and stochastic routing in industrial shipping. - Gregorio Tirado; Lars Magnus Hvattum; Kjetil Fagerholt; Jean-François Cordeau (Comput. Oper. Res., 2013)

A computational comparison of flow formulations for the capacitated location-routing problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (Discret. Optim., 2013)

A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. - Manuel A. Alba Martínez; Jean-François Cordeau; Mauro Dell'Amico; Manuel Iori (INFORMS J. Comput., 2013)

An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. - Enrico Bartolini; Jean-François Cordeau; Gilbert Laporte (Oper. Res., 2013)

Improved lower bounds and exact algorithm for the capacitated arc routing problem. - Enrico Bartolini; Jean-François Cordeau; Gilbert Laporte (Math. Program., 2013)

Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. - Marie-Ève Rancourt; Jean-François Cordeau; Gilbert Laporte (Transp. Sci., 2013)

Pickup-and-Delivery Problems for Goods Transportation. - Maria Battarra; Jean-François Cordeau; Manuel Iori (Vehicle Routing, 2014)

Heuristics for dynamic and stochastic inventory-routing. - Leandro C. Coelho; Jean-François Cordeau; Gilbert Laporte (Comput. Oper. Res., 2014)

Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem. - Karine Sinclair; Jean-François Cordeau; Gilbert Laporte (Eur. J. Oper. Res., 2014)

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (J. Heuristics, 2014)

Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems. - Yossiri Adulyasak; Jean-François Cordeau; Raf Jans (INFORMS J. Comput., 2014)

An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (INFORMS J. Comput., 2014)

Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem. - Yossiri Adulyasak; Jean-François Cordeau; Raf Jans (Transp. Sci., 2014)

Thirty Years of Inventory Routing. - Leandro C. Coelho; Jean-François Cordeau; Gilbert Laporte (Transp. Sci., 2014)

Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem. - Jean-François Cordeau; Gianpaolo Ghiani; Emanuela Guerriero (Transp. Sci., 2014)

A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes. - Ibrahim Muter; Jean-François Cordeau; Gilbert Laporte (Transp. Sci., 2014)

Modeling and solving a logging camp location problem. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (Ann. Oper. Res., 2015)

Robust assembly line balancing with heterogeneous workers. - Mayron César O. Moreira; Jean-François Cordeau; Alysson M. Costa; Gilbert Laporte (Comput. Ind. Eng., 2015)

The production routing problem: A review of formulations and solution algorithms. - Yossiri Adulyasak; Jean-François Cordeau; Raf Jans (Comput. Oper. Res., 2015)

Simulation-based optimization for housekeeping in a container transshipment terminal. - Jean-François Cordeau; Pasquale Legato; Rina Mary Mazza; Roberto Trunfio (Comput. Oper. Res., 2015)

A decomposition-based heuristic for the multiple-product inventory-routing problem. - Jean-François Cordeau; Demetrio Laganà; Roberto Musmanno; Francesca Vocaturo (Comput. Oper. Res., 2015)

Tactical network planning for food aid distribution in Kenya. - Marie-Ève Rancourt; Jean-François Cordeau; Gilbert Laporte; Ben Watkins (Comput. Oper. Res., 2015)

Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. - Babacar Thiongane; Jean-François Cordeau; Bernard Gendron (Comput. Oper. Res., 2015)

Exact and heuristic algorithms for the design of hub networks with multiple lines. - Elisangela Martins de Sá; Iván A. Contreras; Jean-François Cordeau (Eur. J. Oper. Res., 2015)

Benders Decomposition for Production Routing Under Demand Uncertainty. - Yossiri Adulyasak; Jean-François Cordeau; Raf Jans (Oper. Res., 2015)

Dynamic Facility Location with Generalized Modular Capacities. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (Transp. Sci., 2015)

The Hub Line Location Problem. - Elisangela Martins de Sá; Iván A. Contreras; Jean-François Cordeau; Ricardo Saraiva de Camargo; Gilberto de Miranda Jr. (Transp. Sci., 2015)

Solving a dynamic facility location problem with partial closing and reopening. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (Comput. Oper. Res., 2016)

A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem. - Karine Sinclair; Jean-François Cordeau; Gilbert Laporte (Comput. Oper. Res., 2016)

The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty. - Oguz Solyali; Jean-François Cordeau; Gilbert Laporte (Manag. Sci., 2016)

Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. - Sophie N. Parragh; Jean-François Cordeau (Comput. Oper. Res., 2017)

Scheduling identical parallel machines with tooling constraints. - Andreza Cristina Beezão; Jean-François Cordeau; Gilbert Laporte; Horacio Hideki Yanasse (Eur. J. Oper. Res., 2017)

Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds. - Anders N. Gullhav; Jean-François Cordeau; Lars Magnus Hvattum; Bjørn Nygreen (Eur. J. Oper. Res., 2017)

Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (INFORMS J. Comput., 2017)

A decomposition heuristic for a rich production routing problem. - Pedro L. Miranda; Jean-François Cordeau; Deisemara Ferreira; Raf Jans; Reinaldo Morabito (Comput. Oper. Res., 2018)

Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. - Veaceslav Ghilas; Jean-François Cordeau; Emrah Demir; Tom Van Woensel (Transp. Sci., 2018)

A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. - Matthieu Gruson; Majid Bazrafshan; Jean-François Cordeau; Raf Jans (Comput. Oper. Res., 2019)

Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. - Carlos Armando Zetina; Iván A. Contreras; Jean-François Cordeau (Comput. Oper. Res., 2019)

Benders decomposition for very large scale partial set covering and maximal covering location problems. - Jean-François Cordeau; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

Solving the Wire-Harness Design Problem at a European car manufacturer. - Marie-Sklaerder Vié; Nicolas Zufferey; Jean-François Cordeau (Eur. J. Oper. Res., 2019)

Heuristics for electric taxi fleet management at Teo Taxi. - Charly Robinson La Rocca; Jean-François Cordeau (INFOR Inf. Syst. Oper. Res., 2019)

Solving the vessel routing and scheduling problem at a Canadian maritime transportation company. - Louis-Pierre Trottier; Jean-François Cordeau (INFOR Inf. Syst. Oper. Res., 2019)

A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing. - Masoud Chitsaz; Jean-François Cordeau; Raf Jans (INFORMS J. Comput., 2019)

Waste collection inventory routing with non-stationary stochastic demands. - Iliya Markov; Michel Bierlaire; Jean-François Cordeau; Yousef Maknoon; Sacha Varone (Comput. Oper. Res., 2020)

Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling. - Claudia Archetti; Jean-François Cordeau; Guy Desaulniers (EURO J. Transp. Logist., 2020)

Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. - Aldair Alvarez; Jean-François Cordeau; Raf Jans; Pedro Munari; Reinaldo Morabito (Eur. J. Oper. Res., 2020)

A branch-and-cut algorithm for an assembly routing problem. - Masoud Chitsaz; Jean-François Cordeau; Raf Jans (Eur. J. Oper. Res., 2020)

A Decision Support System for Attended Home Services. - Bruno Petrato Bruck; Filippo Castegini; Jean-François Cordeau; Manuel Iori; Tommaso Poncemi; Dario Vezzali (INFORMS J. Appl. Anal., 2020)

A matheuristic for the swap body vehicle routing problem. - Sandra Huber; Jean-François Cordeau; Martin Josef Geiger (OR Spectr., 2020)

The transit time constrained fixed charge multi-commodity network design problem. - Erik Orm Hellsten; David Franz Koza; Iván A. Contreras; Jean-François Cordeau; David Pisinger (Comput. Oper. Res., 2021)

Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure. - Matthieu Gruson; Jean-François Cordeau; Raf Jans (Eur. J. Oper. Res., 2021)

The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company. - Camilo Ortiz-Astorquiza; Jean-François Cordeau; Emma Frejinger (Transp. Sci., 2021)

The doubly open park-and-loop routing problem. - Nicolás Cabrera; Jean-François Cordeau; Jorge E. Mendoza (Comput. Oper. Res., 2022)

An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. - Vinícius R. Máximo; Jean-François Cordeau; Mariá C. V. Nascimento (Comput. Oper. Res., 2022)

A time-space formulation for the locomotive routing problem at the Canadian National Railways. - Pedro L. Miranda; Jean-François Cordeau; Emma Frejinger (Comput. Oper. Res., 2022)

Minimizing Entropy to Discover Good Solutions to Recurrent Mixed Integer Programs. - Charly Robinson La Rocca; Emma Frejinger; Jean-François Cordeau (CoRR, 2022)

Data-driven operations and supply chain management: established research clusters from 2000 to early 2020. - Duy Tan Nguyen; Yossiri Adulyasak; Jean-François Cordeau; Silvia I. Ponce (Int. J. Prod. Res., 2022)

Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution. - Simon Thevenin; Yossiri Adulyasak; Jean-François Cordeau (INFORMS J. Comput., 2022)

Vessel Service Planning in Seaports. - Lingxiao Wu; Yossiri Adulyasak; Jean-François Cordeau; Shuaian Wang (Oper. Res., 2022)

The load planning and sequencing problem for double-stack trains. - Moritz Ruf; Jean-François Cordeau; Emma Frejinger (J. Rail Transp. Plan. Manag., 2022)

The consistent production routing problem. - Aldair Alvarez; Jean-François Cordeau; Raf Jans (Networks, 2022)

Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris. - Jean-François Cordeau; Manuel Iori; Nilson F. M. Mendes; Davide Nelli; Riccardo Tedeschi (INFOR Inf. Syst. Oper. Res., 2023)

Special Issue on Emerging Topics in Transportation Science and Logistics. - Karen R. Smilowitz; Jean-François Cordeau; Barrett W. Thomas; David Pisinger; Yafeng Yin 001; Ann M. Campbell (Transp. Sci., 2023)

A survey of attended home delivery and service problems with a focus on applications. - Jean-François Cordeau; Manuel Iori; Dario Vezzali (4OR, 2023)

Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen. - Simon Belieres; Yossiri Adulyasak; Jean-François Cordeau (Comput. Oper. Res., 2023)

A progressive hedging-based matheuristic for the stochastic production routing problem with adaptive routing. - Ali Kermani; Jean-François Cordeau; Raf Jans (Comput. Oper. Res., 2024)

Unified Branch-and-Benders-Cut for two-stage stochastic mixed-integer programs. - Arthur Mahéo; Simon Belieres; Yossiri Adulyasak; Jean-François Cordeau (Comput. Oper. Res., 2024)

A Numerically Exact Algorithm for the Bin-Packing Problem. - Roberto Baldacci; Stefano Coniglio; Jean-François Cordeau; Fabio Furini (INFORMS J. Comput., 2024)

AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem. - Vinícius R. Máximo; Jean-François Cordeau; Mariá C. V. Nascimento (INFORMS J. Comput., 2024)

Modeling and Solving the Traveling Salesman Problem with Speed Optimization for a Plug-In Hybrid Electric Vehicle. - Fuliang Wu; Yossiri Adulyasak; Jean-François Cordeau (Transp. Sci., 2024)

Split demand and deliveries in an integrated three-level lot sizing and replenishment problem. - Matthieu Gruson; Jean-François Cordeau; Raf Jans (Comput. Oper. Res., 2024)

One-Shot Learning for MIPs with SOS1 Constraints. - Charly Robinson La Rocca; Jean-François Cordeau; Emma Frejinger (Oper. Res. Forum, 2024)

An updated survey of attended home delivery and service problems with a focus on applications. - Jean-François Cordeau; Manuel Iori; Dario Vezzali (Ann. Oper. Res., 2024)

Satellite Scheduling Problems: A survey of applications in Earth and outer space observation. - Benedetta Ferrari; Jean-François Cordeau; Maxence Delorme; Manuel Iori; Roberto Orosei (Comput. Oper. Res., 2025)

Integrating storage allocation with manual order picking and replenishment operations in a distribution centre. - Jean-François Cordeau; Pasquale Legato; Rina Mary Mazza (Int. J. Prod. Res., 2025)

Intermodal Hub Network Design with Probabilistic Service-Level Constraints. - Mario José Basallo-Triana; Jean-François Cordeau; Navneet Vidyarthi (Transp. Sci., 2025)

A hybrid adaptive iterated local search heuristic for the maximal covering location problem. - Vinícius R. Máximo; Jean-François Cordeau; Mariá C. V. Nascimento (Int. Trans. Oper. Res., 2025)

The workforce scheduling and routing problem with park-and-loop. - Nicolás Cabrera; Jean-François Cordeau; Jorge E. Mendoza (Networks, 2025)