Jean-François Cordeau
Orcid: 0000-0002-4963-1298
According to our database1,
Jean-François Cordeau
authored at least 152 papers
between 1997 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
2025
0
5
10
1
2
1
3
8
4
9
3
6
7
2
4
3
11
9
6
9
7
10
10
7
10
3
3
3
1
1
3
2
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Networks, January, 2025
A hybrid adaptive iterated local search heuristic for the maximal covering location problem.
Int. Trans. Oper. Res., January, 2025
Satellite Scheduling Problems: A survey of applications in Earth and outer space observation.
Comput. Oper. Res., 2025
2024
An updated survey of attended home delivery and service problems with a focus on applications.
Ann. Oper. Res., December, 2024
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem.
Comput. Oper. Res., January, 2024
Modeling and Solving the Traveling Salesman Problem with Speed Optimization for a Plug-In Hybrid Electric Vehicle.
Transp. Sci., 2024
AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem.
INFORMS J. Comput., 2024
Comput. Oper. Res., 2024
A progressive hedging-based matheuristic for the stochastic production routing problem with adaptive routing.
Comput. Oper. Res., 2024
2023
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., December, 2023
A survey of attended home delivery and service problems with a focus on applications.
4OR, December, 2023
Transp. Sci., July, 2023
Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris.
INFOR Inf. Syst. Oper. Res., January, 2023
2022
J. Rail Transp. Plan. Manag., 2022
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution.
INFORMS J. Comput., 2022
Data-driven operations and supply chain management: established research clusters from 2000 to early 2020.
Int. J. Prod. Res., 2022
CoRR, 2022
A time-space formulation for the locomotive routing problem at the Canadian National Railways.
Comput. Oper. Res., 2022
An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem.
Comput. Oper. Res., 2022
2021
The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company.
Transp. Sci., 2021
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure.
Eur. J. Oper. Res., 2021
Comput. Oper. Res., 2021
2020
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products.
Eur. J. Oper. Res., 2020
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling.
EURO J. Transp. Logist., 2020
Comput. Oper. Res., 2020
2019
A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing.
INFORMS J. Comput., 2019
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company.
INFOR Inf. Syst. Oper. Res., 2019
INFOR Inf. Syst. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Benders decomposition for very large scale partial set covering and maximal covering location problems.
Eur. J. Oper. Res., 2019
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design.
Comput. Oper. Res., 2019
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure.
Comput. Oper. Res., 2019
2018
Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines.
Transp. Sci., 2018
Comput. Oper. Res., 2018
2017
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities.
INFORMS J. Comput., 2017
Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds.
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows.
Comput. Oper. Res., 2017
2016
Manag. Sci., 2016
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem.
Comput. Oper. Res., 2016
Comput. Oper. Res., 2016
2015
Oper. Res., 2015
Eur. J. Oper. Res., 2015
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem.
Comput. Oper. Res., 2015
Comput. Oper. Res., 2015
Comput. Oper. Res., 2015
Simulation-based optimization for housekeeping in a container transshipment terminal.
Comput. Oper. Res., 2015
Comput. Oper. Res., 2015
2014
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes.
Transp. Sci., 2014
Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem.
Transp. Sci., 2014
Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem.
Transp. Sci., 2014
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem.
INFORMS J. Comput., 2014
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems.
INFORMS J. Comput., 2014
J. Heuristics, 2014
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem.
Eur. J. Oper. Res., 2014
Proceedings of the Vehicle Routing, 2014
2013
Math. Program., 2013
Oper. Res., 2013
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks.
INFORMS J. Comput., 2013
A computational comparison of flow formulations for the capacitated location-routing problem.
Discret. Optim., 2013
Comput. Oper. Res., 2013
2012
Transp. Sci., 2012
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints.
OR Spectr., 2012
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows.
J. Oper. Res. Soc., 2012
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.
INFORMS J. Comput., 2012
A branch-price-and-cut method for a ship routing and scheduling problem with split loads.
Comput. Oper. Res., 2012
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
2011
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services.
Networks, 2011
Eur. J. Oper. Res., 2011
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays.
Discret. Appl. Math., 2011
A large neighbourhood search heuristic for the aircraft and passenger recovery problem.
4OR, 2011
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search.
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
Implicit shift scheduling with multiple breaks and work stretch duration restrictions.
J. Sched., 2010
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.
Networks, 2010
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
Math. Program., 2010
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discret. Appl. Math., 2010
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading.
Comput. Oper. Res., 2010
2009
Transp. Sci., 2009
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine.
J. Sched., 2009
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.
Networks, 2009
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
Benders, metric and cutset inequalities for multicommodity capacitated network design.
Comput. Optim. Appl., 2009
2008
A two-level simulated annealing algorithm for efficient dissemination of electronic content.
J. Oper. Res. Soc., 2008
Eur. J. Oper. Res., 2008
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.
Eur. J. Oper. Res., 2008
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times.
Comput. Oper. Res., 2008
Exact algorithms for the joint object placement and request routing problem in content distribution networks.
Comput. Oper. Res., 2008
2007
Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
Networks, 2007
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
INFORMS J. Comput., 2007
INFOR Inf. Syst. Oper. Res., 2007
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique.
INFOR Inf. Syst. Oper. Res., 2007
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.
INFOR Inf. Syst. Oper. Res., 2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
Eur. J. Oper. Res., 2007
2006
INFORMS J. Comput., 2006
2005
Transp. Sci., 2005
J. Oper. Res. Soc., 2005
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem.
Comput. Oper. Res., 2005
2004
Parallel Comput., 2004
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows.
J. Oper. Res. Soc., 2004
Ann. Oper. Res., 2004
2003
2002
2001
Transp. Sci., 2001
J. Oper. Res. Soc., 2001
Oper. Res., 2001
2000
Transp. Sci., 2000
Oper. Res., 2000
1998
1997
Networks, 1997