Jean-François Cordeau

From MaRDI portal
Person:297220

Available identifiers

zbMath Open cordeau.jean-francoisDBLP68/5116WikidataQ102078717 ScholiaQ102078717MaRDI QIDQ297220

List of research outcomes





PublicationDate of PublicationType
The workforce scheduling and routing problem with park-and-loop2025-01-15Paper
A hybrid adaptive iterated local search heuristic for the maximal covering location problem2024-09-24Paper
AILS-II: an adaptive iterated local search heuristic for the large-scale capacitated vehicle routing problem2024-09-05Paper
One-shot learning for MIPs with SOS1 constraints2024-07-25Paper
Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs2024-06-06Paper
A Numerically Exact Algorithm for the Bin-Packing Problem2024-03-26Paper
A survey of attended home delivery and service problems with a focus on applications2024-01-23Paper
Pseudo-random Instance Generators in C++ for Deterministic and Stochastic Multi-commodity Network Design Problems2023-12-17Paper
The consistent production routing problem2023-12-12Paper
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem2023-11-15Paper
Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen2023-11-13Paper
Étude comparative de divers modèles pour le problème de transport à la demande2023-05-09Paper
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique2023-05-09Paper
Locating Satellite Yards in Forestry Operations2023-05-09Paper
Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière2023-05-09Paper
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading2023-05-09Paper
Un Modèle Pour La Conception D’Un Réseau De Distribution Avec Localisation, Aefectation Et Stocks2023-05-05Paper
Steiner Tree Problems With Profits2023-05-05Paper
A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows2023-04-24Paper
Heuristics for electric taxi fleet management at Teo Taxi2023-03-20Paper
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company2023-03-20Paper
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution2023-01-11Paper
An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem2022-09-27Paper
Vessel Service Planning in Seaports2022-09-19Paper
The doubly open park-and-loop routing problem2022-06-22Paper
AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-scale Capacitated Vehicle Routing Problem2022-05-24Paper
The transit time constrained fixed charge multi-commodity network design problem2022-03-09Paper
A time-space formulation for the locomotive routing problem at the Canadian National Railways2022-03-09Paper
An Adaptive Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem2021-11-24Paper
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure2021-06-04Paper
A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing2020-12-02Paper
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products2020-01-23Paper
A branch-and-cut algorithm for an assembly routing problem2020-01-23Paper
Waste collection inventory routing with non-stationary stochastic demands2019-11-11Paper
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure2019-09-25Paper
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design2019-09-25Paper
Benders decomposition for very large scale partial set covering and maximal covering location problems2019-02-11Paper
Solving the wire-harness design problem at a European car manufacturer2018-10-30Paper
A computational comparison of flow formulations for the capacitated location-routing problem2018-10-18Paper
A decomposition heuristic for a rich production routing problem2018-07-12Paper
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows2018-07-11Paper
Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds2018-05-25Paper
Scheduling identical parallel machines with tooling constraints2018-05-24Paper
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities2017-12-29Paper
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem2017-03-01Paper
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems2017-03-01Paper
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem2016-11-17Paper
Solving a dynamic facility location problem with partial closing and reopening2016-11-17Paper
An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics2016-11-11Paper
Heuristics for dynamic and stochastic routing in industrial shipping2016-11-11Paper
A branch-price-and-cut method for a ship routing and scheduling problem with split loads2016-11-11Paper
The production routing problem: a review of formulations and solution algorithms2016-11-10Paper
Heuristics for dynamic and stochastic inventory-routing2016-11-10Paper
Tactical network planning for food aid distribution in Kenya2016-11-10Paper
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem2016-11-10Paper
Simulation-based optimization for housekeeping in a container transshipment terminal2016-11-10Paper
A decomposition-based heuristic for the multiple-product inventory-routing problem2016-11-10Paper
Exact and heuristic algorithms for the design of hub networks with multiple lines2016-10-06Paper
A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem2016-06-29Paper
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem2016-06-24Paper
Benders Decomposition for Production Routing Under Demand Uncertainty2016-01-22Paper
Modeling and solving a logging camp location problem2015-10-29Paper
An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand2013-07-02Paper
Improved lower bounds and exact algorithm for the capacitated arc routing problem2013-03-18Paper
Accelerating benders decomposition with heuristicmaster problem solutions2013-01-28Paper
The inventory-routing problem with transshipment2012-11-15Paper
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints2012-08-13Paper
Accelerating Benders decomposition by local branching2012-07-28Paper
Benders decomposition for large-scale uncapacitated hub location2012-06-26Paper
The delivery man problem with time windows2012-06-20Paper
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading2012-06-18Paper
A memetic heuristic for the generalized quadratic assignment problem2012-06-18Paper
Stochastic uncapacitated hub location2012-05-14Paper
Optimizing yard assignment in an automotive transshipment terminal2012-05-14Paper
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search2011-09-09Paper
An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays2011-06-01Paper
Benders, metric and cutset inequalities for multicommodity capacitated network design2011-03-24Paper
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services2011-02-17Paper
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading2010-11-24Paper
A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem2010-11-05Paper
Scheduling technicians and tasks in a telecommunications company2010-10-08Paper
Recent Models and Algorithms for One-to-One Pickup and Delivery Problems2010-06-02Paper
Implicit shift scheduling with multiple breaks and work stretch duration restrictions2010-05-07Paper
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm2010-02-19Paper
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading2009-12-22Paper
The attractive traveling salesman problem2009-12-07Paper
Dynamic pickup and delivery problems2009-11-17Paper
A two-level simulated annealing algorithm for efficient dissemination of electronic content2009-08-28Paper
A tabu search heuristic for the quay crane scheduling problem2009-08-28Paper
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine2009-08-28Paper
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem2009-08-13Paper
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints2009-07-28Paper
Simultaneous Assignment of Locomotives and Cars to Passenger Trains2009-07-03Paper
A column generation heuristic for a dynamic generalized assignment problem2009-04-03Paper
The pickup and delivery traveling salesman problem with first-in-first-out loading2009-02-12Paper
Solution approaches to large shift scheduling problems2008-11-19Paper
A tabu search heuristic for the generalized minimum spanning tree problem2008-07-21Paper
Iterated tabu search for the car sequencing problem2008-07-10Paper
Exact algorithms for the joint object placement and request routing problem in content distribution networks2008-05-23Paper
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints2008-04-24Paper
The dial-a-ride problem: Models and algorithms2008-03-31Paper
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times2008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54318232008-01-02Paper
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)2007-08-31Paper
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows2007-07-30Paper
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal2007-02-20Paper
An integrated model for logistics network design2007-02-15Paper
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites2006-12-07Paper
The service allocation problem at the Gioia Tauro maritime terminal2006-11-15Paper
The multi-depot vehicle routing problem with inter-depot routes2006-11-15Paper
https://portal.mardi4nfdi.de/entity/Q54942162006-10-17Paper
https://portal.mardi4nfdi.de/entity/Q56926282005-09-28Paper
Maximizing the value of an Earth observation satellite orbit2005-09-01Paper
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows2005-04-04Paper
A unified tabu search heuristic for vehicle routing problems with time windows2005-03-16Paper
A guide to vehicle routing heuristics2005-03-14Paper
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem2005-02-22Paper
Scheduling linen deliveries in a large hospital2005-01-19Paper
Using Benders decomposition to implicitly model tour scheduling2004-08-10Paper
The dial-a-ride problem (DARP): variants, modeling issues and algorithms2004-06-11Paper
A Benders decomposition approach for the locomotive and car assignment problem2002-10-17Paper
Close-Point Spatial Tests and Their Application to Random Number Generators2002-06-04Paper
A survey of optimization models for train routing and scheduling2002-04-17Paper
https://portal.mardi4nfdi.de/entity/Q45322292002-01-01Paper
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling2001-01-01Paper
A tabu search heuristic for periodic and multi-depot vehicle routing problems1997-10-26Paper
One-shot Learning for MIPs with SOS1 ConstraintsN/APaper

Research outcomes over time

This page was built for person: Jean-François Cordeau