Jean-François Cordeau

According to our database1, Jean-François Cordeau authored at least 123 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A matheuristic for the swap body vehicle routing problem.
OR Spectr., 2020

A Decision Support System for Attended Home Services.
Interfaces, 2020

A branch-and-cut algorithm for an assembly routing problem.
Eur. J. Oper. Res., 2020

Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products.
Eur. J. Oper. Res., 2020

Waste collection inventory routing with non-stationary stochastic demands.
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

Heuristics for electric taxi fleet management at Teo Taxi.
INFOR Inf. Syst. Oper. Res., 2019

Solving the Wire-Harness Design Problem at a European car manufacturer.
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

A decomposition heuristic for a rich production routing problem.
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

Scheduling identical parallel machines with tooling constraints.
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
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty.
Manag. Sci., 2016

A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem.
Comput. Oper. Res., 2016

Solving a dynamic facility location problem with partial closing and reopening.
Comput. Oper. Res., 2016

2015
The Hub Line Location Problem.
Transp. Sci., 2015

Dynamic Facility Location with Generalized Modular Capacities.
Transp. Sci., 2015

Benders Decomposition for Production Routing Under Demand Uncertainty.
Oper. Res., 2015

Exact and heuristic algorithms for the design of hub networks with multiple lines.
Eur. J. Oper. Res., 2015

Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem.
Comput. Oper. Res., 2015

Tactical network planning for food aid distribution in Kenya.
Comput. Oper. Res., 2015

A decomposition-based heuristic for the multiple-product inventory-routing problem.
Comput. Oper. Res., 2015

Simulation-based optimization for housekeeping in a container transshipment terminal.
Comput. Oper. Res., 2015

The production routing problem: A review of formulations and solution algorithms.
Comput. Oper. Res., 2015

Robust assembly line balancing with heterogeneous workers.
Comput. Ind. Eng., 2015

Modeling and solving a logging camp location problem.
Ann. 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

Thirty Years of Inventory Routing.
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

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem.
J. Heuristics, 2014

Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem.
Eur. J. Oper. Res., 2014

Heuristics for dynamic and stochastic inventory-routing.
Comput. Oper. Res., 2014

Pickup-and-Delivery Problems for Goods Transportation.
Proceedings of the Vehicle Routing, 2014

2013
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules.
Transp. Sci., 2013

Improved lower bounds and exact algorithm for the capacitated arc routing problem.
Math. Program., 2013

An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand.
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

Heuristics for dynamic and stochastic routing in industrial shipping.
Comput. Oper. Res., 2013

2012
Robust Inventory Routing Under Demand Uncertainty.
Transp. Sci., 2012

Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels.
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

A parallel iterated tabu search heuristic for vehicle routing problems.
Comput. Oper. Res., 2012

The inventory-routing problem with transshipment.
Comput. Oper. Res., 2012

2011
The Dynamic Uncapacitated Hub Location Problem.
Transp. Sci., 2011

Modeling and solving a multimodal transportation problem with flexible-time and scheduled services.
Networks, 2011

Benders Decomposition for Large-Scale Uncapacitated Hub Location.
Oper. Res., 2011

Optimizing yard assignment in an automotive transshipment terminal.
Eur. J. Oper. Res., 2011

Stochastic uncapacitated hub location.
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

Scheduling technicians and tasks in a telecommunications company.
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

The Attractive Traveling Salesman Problem.
Eur. J. Oper. Res., 2010

Dynamic pickup and delivery problems.
Eur. J. Oper. Res., 2010

The Delivery Man Problem with time windows.
Discret. Optim., 2010

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discret. Appl. Math., 2010

The dynamic multi-period vehicle routing problem.
Comput. Oper. Res., 2010

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading.
Comput. Oper. Res., 2010

2009
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows.
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

Vehicle routing with cross-docking.
J. Oper. Res. Soc., 2009

Accelerating Benders Decomposition by Local Branching.
INFORMS J. Comput., 2009

Locating Satellite Yards in Forestry Operations.
INFOR Inf. Syst. Oper. Res., 2009

A column generation heuristic for a dynamic generalized assignment problem.
Comput. Oper. Res., 2009

The pickup and delivery traveling salesman problem with first-in-first-out loading.
Comput. Oper. Res., 2009

Benders, metric and cutset inequalities for multicommodity capacitated network design.
Comput. Optim. Appl., 2009

Quality of service in dial-a-ride operations.
Comput. Ind. Eng., 2009

2008
Solution approaches to large shift scheduling problems.
RAIRO Oper. Res., 2008

A two-level simulated annealing algorithm for efficient dissemination of electronic content.
J. Oper. Res. Soc., 2008

A tabu search heuristic for the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2008

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.
Eur. J. Oper. Res., 2008

Iterated tabu search for the car sequencing problem.
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

Étude comparative de divers modèles pour le problème de transport à la demande.
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

The multi-depot vehicle routing problem with inter-depot routes.
Eur. J. Oper. Res., 2007

The service allocation problem at the Gioia Tauro Maritime Terminal.
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

The dial-a-ride problem: models and algorithms.
Ann. Oper. Res., 2007

Chapter 6 Vehicle Routing.
Proceedings of the Transportation, 2007

Chapter 7 Transportation on Demand.
Proceedings of the Transportation, 2007

2006
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem.
Oper. Res., 2006

A Memetic Heuristic for the Generalized Quadratic Assignment Problem.
INFORMS J. Comput., 2006

An integrated model for logistics network design.
Ann. Oper. Res., 2006

2005
Models and Tabu Search Heuristics for the Berth-Allocation Problem.
Transp. Sci., 2005

Maximizing the value of an Earth observation satellite orbit.
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 Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem.
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

Using Benders Decomposition to Implicitly Model Tour Scheduling.
Ann. Oper. Res., 2004

2003
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms.
4OR, 2003

2002
A guide to vehicle routing heuristics.
J. Oper. Res. Soc., 2002

VRP with Time Windows.
Proceedings of the Vehicle Routing Problem., 2002

2001
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling.
Transp. Sci., 2001

A unified tabu search heuristic for vehicle routing problems with time windows.
J. Oper. Res. Soc., 2001

Simultaneous Assignment of Locomotives and Cars to Passenger Trains.
Oper. Res., 2001

2000
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem.
Transp. Sci., 2000

Close-Point Spatial Tests and Their Application to Random Number Generators.
Oper. Res., 2000

1998
A Survey of Optimization Models for Train Routing and Scheduling.
Transp. Sci., 1998

Scheduling linen deliveries in a large hospital.
J. Oper. Res. Soc., 1998

1997
A tabu search heuristic for periodic and multi-depot vehicle routing problems.
Networks, 1997


  Loading...