Jean-François Cordeau

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 49

Top Venues

Publications

Matthieu Gruson, Jean-François Cordeau, Raf Jans
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem. Comput. Oper. Res. 161 (2024)
Karen R. Smilowitz, Jean-François Cordeau, Barrett W. Thomas, David Pisinger, Yafeng Yin, Ann M. Campbell
Special Issue on Emerging Topics in Transportation Science and Logistics. Transp. Sci. 57 (4) (2023)
Jean-François Cordeau, Manuel Iori, Nilson F. M. Mendes, Davide Nelli, Riccardo Tedeschi
Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris. INFOR Inf. Syst. Oper. Res. 61 (1) (2023)
Simon Belieres, Yossiri Adulyasak, Jean-François Cordeau
Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen. Comput. Oper. Res. 160 (2023)
Jean-François Cordeau, Manuel Iori, Dario Vezzali
A survey of attended home delivery and service problems with a focus on applications. 4OR 21 (4) (2023)
Aldair Alvarez, Jean-François Cordeau, Raf Jans
The consistent production routing problem. Networks 80 (3) (2022)
Moritz Ruf, Jean-François Cordeau, Emma Frejinger
The load planning and sequencing problem for double-stack trains. J. Rail Transp. Plan. Manag. 23 (2022)
Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento
An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Comput. Oper. Res. 148 (2022)
Pedro Miranda, Jean-François Cordeau, Emma Frejinger
A time-space formulation for the locomotive routing problem at the Canadian National Railways. Comput. Oper. Res. 139 (2022)
Charly Robinson La Rocca, Emma Frejinger, Jean-François Cordeau
Minimizing Entropy to Discover Good Solutions to Recurrent Mixed Integer Programs. CoRR (2022)
Lingxiao Wu, Yossiri Adulyasak, Jean-François Cordeau, Shuaian Wang
Vessel Service Planning in Seaports. Oper. Res. 70 (4) (2022)
Duy Tan Nguyen, Yossiri Adulyasak, Jean-François Cordeau, Silvia I. Ponce
Data-driven operations and supply chain management: established research clusters from 2000 to early 2020. Int. J. Prod. Res. 60 (17) (2022)
Nicolás Cabrera, Jean-François Cordeau, Jorge E. Mendoza
The doubly open park-and-loop routing problem. Comput. Oper. Res. 143 (2022)
Matthieu Gruson, Jean-François Cordeau, Raf Jans
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure. Eur. J. Oper. Res. 291 (1) (2021)
Erik Orm Hellsten, David Franz Koza, Iván A. Contreras, Jean-François Cordeau, David Pisinger
The transit time constrained fixed charge multi-commodity network design problem. Comput. Oper. Res. 136 (2021)
Camilo Ortiz-Astorquiza, Jean-François Cordeau, Emma Frejinger
The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company. Transp. Sci. 55 (2) (2021)
Aldair Alvarez, Jean-François Cordeau, Raf Jans, Pedro Munari, Reinaldo Morabito
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. Eur. J. Oper. Res. 283 (2) (2020)
Sandra Huber, Jean-François Cordeau, Martin Josef Geiger
A matheuristic for the swap body vehicle routing problem. OR Spectr. 42 (1) (2020)
Bruno Petrato Bruck, Filippo Castegini, Jean-François Cordeau, Manuel Iori, Tommaso Poncemi, Dario Vezzali
A Decision Support System for Attended Home Services. INFORMS J. Appl. Anal. 50 (2) (2020)
Claudia Archetti, Jean-François Cordeau, Guy Desaulniers
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling. EURO J. Transp. Logist. 9 (4) (2020)
Iliya Markov, Michel Bierlaire, Jean-François Cordeau, Yousef Maknoon, Sacha Varone
Waste collection inventory routing with non-stationary stochastic demands. Comput. Oper. Res. 113 (2020)
Masoud Chitsaz, Jean-François Cordeau, Raf Jans
A branch-and-cut algorithm for an assembly routing problem. Eur. J. Oper. Res. 282 (3) (2020)
Marie-Sklaerder Vié, Nicolas Zufferey, Jean-François Cordeau
Solving the Wire-Harness Design Problem at a European car manufacturer. Eur. J. Oper. Res. 272 (2) (2019)
Carlos Armando Zetina, Iván A. Contreras, Jean-François Cordeau
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. Comput. Oper. Res. 111 (2019)
Charly Robinson La Rocca, Jean-François Cordeau
Heuristics for electric taxi fleet management at Teo Taxi. INFOR Inf. Syst. Oper. Res. 57 (4) (2019)
Jean-François Cordeau, Fabio Furini, Ivana Ljubic
Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275 (3) (2019)
Louis-Pierre Trottier, Jean-François Cordeau
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company. INFOR Inf. Syst. Oper. Res. 57 (2) (2019)
Matthieu Gruson, Majid Bazrafshan, Jean-François Cordeau, Raf Jans
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. Comput. Oper. Res. 111 (2019)
Masoud Chitsaz, Jean-François Cordeau, Raf Jans
A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing. INFORMS J. Comput. 31 (1) (2019)
Veaceslav Ghilas, Jean-François Cordeau, Emrah Demir, Tom Van Woensel
Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. Transp. Sci. 52 (5) (2018)
Pedro Miranda, Jean-François Cordeau, Deisemara Ferreira, Raf Jans, Reinaldo Morabito
A decomposition heuristic for a rich production routing problem. Comput. Oper. Res. 98 (2018)
Sophie N. Parragh, Jean-François Cordeau
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83 (2017)
Anders N. Gullhav, Jean-François Cordeau, Lars Magnus Hvattum, Bjørn Nygreen
Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds. Eur. J. Oper. Res. 259 (3) (2017)
Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse
Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257 (3) (2017)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities. INFORMS J. Comput. 29 (3) (2017)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Solving a dynamic facility location problem with partial closing and reopening. Comput. Oper. Res. 67 (2016)
Oguz Solyali, Jean-François Cordeau, Gilbert Laporte
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty. Manag. Sci. 62 (4) (2016)
Karine Sinclair, Jean-François Cordeau, Gilbert Laporte
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem. Comput. Oper. Res. 65 (2016)
Jean-François Cordeau, Demetrio Laganà, Roberto Musmanno, Francesca Vocaturo
A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 55 (2015)
Yossiri Adulyasak, Jean-François Cordeau, Raf Jans
Benders Decomposition for Production Routing Under Demand Uncertainty. Oper. Res. 63 (4) (2015)
Marie-Eve Rancourt, Jean-François Cordeau, Gilbert Laporte, Ben Watkins
Tactical network planning for food aid distribution in Kenya. Comput. Oper. Res. 56 (2015)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Modeling and solving a logging camp location problem. Ann. Oper. Res. 232 (1) (2015)
Jean-François Cordeau, Pasquale Legato, Rina Mary Mazza, Roberto Trunfio
Simulation-based optimization for housekeeping in a container transshipment terminal. Comput. Oper. Res. 53 (2015)
Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau
Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246 (1) (2015)
Babacar Thiongane, Jean-François Cordeau, Bernard Gendron
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. Comput. Oper. Res. 53 (2015)
Mayron César O. Moreira, Jean-François Cordeau, Alysson M. Costa, Gilbert Laporte
Robust assembly line balancing with heterogeneous workers. Comput. Ind. Eng. 88 (2015)
Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.
The Hub Line Location Problem. Transp. Sci. 49 (3) (2015)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Dynamic Facility Location with Generalized Modular Capacities. Transp. Sci. 49 (3) (2015)
Yossiri Adulyasak, Jean-François Cordeau, Raf Jans
The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55 (2015)
Jean-François Cordeau, Gianpaolo Ghiani, Emanuela Guerriero
Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem. Transp. Sci. 48 (1) (2014)
Yossiri Adulyasak, Jean-François Cordeau, Raf Jans
Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem. Transp. Sci. 48 (1) (2014)
Karine Sinclair, Jean-François Cordeau, Gilbert Laporte
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem. Eur. J. Oper. Res. 233 (1) (2014)
Yossiri Adulyasak, Jean-François Cordeau, Raf Jans
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems. INFORMS J. Comput. 26 (1) (2014)
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20 (1) (2014)
Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte
Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52 (2014)
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. INFORMS J. Comput. 26 (1) (2014)
Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte
Thirty Years of Inventory Routing. Transp. Sci. 48 (1) (2014)
Ibrahim Muter, Jean-François Cordeau, Gilbert Laporte
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes. Transp. Sci. 48 (3) (2014)
Manuel A. Alba Martínez, Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS J. Comput. 25 (1) (2013)
Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau
Heuristics for dynamic and stochastic routing in industrial shipping. Comput. Oper. Res. 40 (1) (2013)
Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte
An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Oper. Res. 61 (2) (2013)
Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte
Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math. Program. 137 (1-2) (2013)
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
A computational comparison of flow formulations for the capacitated location-routing problem. Discret. Optim. 10 (4) (2013)
Marie-Eve Rancourt, Jean-François Cordeau, Gilbert Laporte
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. Transp. Sci. 47 (1) (2013)
Magnus Stålhane, Henrik Andersson, Marielle Christiansen, Jean-François Cordeau, Guy Desaulniers
A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Comput. Oper. Res. 39 (12) (2012)
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS J. Comput. 24 (3) (2012)
Oguz Solyali, Jean-François Cordeau, Gilbert Laporte
Robust Inventory Routing Under Demand Uncertainty. Transp. Sci. 46 (3) (2012)
Luigi Moccia, Jean-François Cordeau, Gilbert Laporte
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63 (2) (2012)
Jean-François Cordeau, Mirko Maischberger
A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39 (9) (2012)
Vera C. Hemmelmayr, Jean-François Cordeau, Teodor Gabriel Crainic
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Comput. Oper. Res. 39 (12) (2012)
Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte
The inventory-routing problem with transshipment. Comput. Oper. Res. 39 (11) (2012)
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. Transp. Sci. 46 (4) (2012)
Sophie N. Parragh, Jean-François Cordeau, Karl F. Doerner, Richard F. Hartl
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectr. 34 (3) (2012)
Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino
Optimizing yard assignment in an automotive transshipment terminal. Eur. J. Oper. Res. 215 (1) (2011)
Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. Discret. Appl. Math. 159 (9) (2011)
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
The Dynamic Uncapacitated Hub Location Problem. Transp. Sci. 45 (1) (2011)
Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57 (1) (2011)
Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin
A large neighbourhood search heuristic for the aircraft and passenger recovery problem. 4OR 9 (2) (2011)
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
Benders Decomposition for Large-Scale Uncapacitated Hub Location. Oper. Res. 59 (6) (2011)
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212 (3) (2011)
Mirko Maischberger, Jean-François Cordeau
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search. INOC (2011)
Günes Erdogan, Jean-François Cordeau, Gilbert Laporte
The Attractive Traveling Salesman Problem. Eur. J. Oper. Res. 203 (1) (2010)
Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte
The Delivery Man Problem with time windows. Discret. Optim. 7 (4) (2010)
Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen
The dynamic multi-period vehicle routing problem. Comput. Oper. Res. 37 (9) (2010)
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte
Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202 (1) (2010)
Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 37 (5) (2010)
Günes Erdogan, Jean-François Cordeau, Gilbert Laporte
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. Discret. Appl. Math. 158 (15) (2010)
Monia Rekik, Jean-François Cordeau, François Soumis
Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Sched. 13 (1) (2010)
Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke
Scheduling technicians and tasks in a telecommunications company. J. Sched. 13 (4) (2010)
Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121 (2) (2010)
Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55 (1) (2010)
Alysson M. Costa, Jean-François Cordeau, Bernard Gendron
Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42 (3) (2009)
Gabriella Stecco, Jean-François Cordeau, Elena Moretti
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine. J. Sched. 12 (1) (2009)
Stefan Ropke, Jean-François Cordeau
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. Transp. Sci. 43 (3) (2009)
Günes Erdogan, Jean-François Cordeau, Gilbert Laporte
The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput. Oper. Res. 36 (6) (2009)
Julie Paquette, Jean-François Cordeau, Gilbert Laporte
Quality of service in dial-a-ride operations. Comput. Ind. Eng. 56 (4) (2009)
Tuyva Chan, Jean-François Cordeau, Gilbert Laporte
Locating Satellite Yards in Forestry Operations. INFOR Inf. Syst. Oper. Res. 47 (3) (2009)
Walter Rei, Jean-François Cordeau, Michel Gendreau, Patrick Soriano
Accelerating Benders Decomposition by Local Branching. INFORMS J. Comput. 21 (2) (2009)
Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra
A column generation heuristic for a dynamic generalized assignment problem. Comput. Oper. Res. 36 (9) (2009)
Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks 53 (2) (2009)

Jean-François Cordeau.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean-François Cordeau