Jean‐françois Cordeau
#138,367
Most Influential Person Now
Jean‐françois Cordeau's AcademicInfluence.com Rankings
Jean‐françois Cordeauengineering Degrees
Engineering
#5065
World Rank
#6304
Historical Rank
Industrial Engineering
#31
World Rank
#33
Historical Rank
Jean‐françois Cordeaumathematics Degrees
Mathematics
#6560
World Rank
#9064
Historical Rank
Operations Research
#53
World Rank
#54
Historical Rank
Download Badge
Engineering Mathematics
Why Is Jean‐françois Cordeau Influential?
(Suggest an Edit or Addition)Jean‐françois Cordeau's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A unified tabu search heuristic for vehicle routing problems with time windows (2001) (949)
- A tabu search heuristic for periodic and multi-depot vehicle routing problems (1997) (882)
- The dial-a-ride problem: models and algorithms (2006) (817)
- A Survey of Optimization Models for Train Routing and Scheduling (1998) (803)
- Static pickup and delivery problems: a classification scheme and survey (2007) (690)
- A guide to vehicle routing heuristics (2002) (655)
- Dynamic pickup and delivery problems (2010) (654)
- A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem (2002) (623)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (2006) (588)
- Thirty Years of Inventory Routing (2014) (535)
- VRP with Time Windows (1999) (455)
- An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics (2012) (420)
- Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009) (413)
- Models and Tabu Search Heuristics for the Berth-Allocation Problem (2005) (394)
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms (2003) (339)
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling (2000) (315)
- An integrated model for logistics network design (2006) (293)
- New Heuristics for the Vehicle Routing Problem (2005) (292)
- Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem (2004) (250)
- Notice of Violation of IEEE Publication PrinciplesA Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes (2007) (239)
- A parallel iterated tabu search heuristic for vehicle routing problems (2012) (237)
- Chapter 6 Vehicle Routing (2007) (235)
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem (2003) (235)
- Vehicle routing with cross-docking (2009) (229)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (2012) (225)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (2007) (222)
- A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal (2006) (220)
- Stochastic uncapacitated hub location (2011) (219)
- Benders Decomposition for Large-Scale Uncapacitated Hub Location (2011) (207)
- The production routing problem: A review of formulations and solution algorithms (2015) (205)
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites (2007) (198)
- The inventory-routing problem with transshipment (2012) (196)
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem (1998) (190)
- Consistency in multi-vehicle inventory-routing (2012) (183)
- A tabu search heuristic for the quay crane scheduling problem (2007) (180)
- Accelerating Benders Decomposition by Local Branching (2009) (175)
- Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem (2011) (170)
- Scheduling technicians and tasks in a telecommunications company (2008) (163)
- Models and branch-and-cut algorithms for pickup and delivery problems with time windows (2007) (160)
- Benders Decomposition for Production Routing Under Demand Uncertainty (2012) (154)
- Tabu Search Heuristics for the Vehicle Routing Problem (2005) (142)
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains (1998) (141)
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading (2007) (132)
- Maximizing the value of an Earth observation satellite orbit (2005) (126)
- The dynamic multi-period vehicle routing problem (2010) (125)
- Quality of service in dial-a-ride operations (2009) (122)
- Robust Inventory Routing Under Demand Uncertainty (2012) (118)
- The service allocation problem at the Gioia Tauro Maritime Terminal (2007) (114)
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows (2004) (113)
- Pickup-and-Delivery Problems for Goods Transportation (2014) (112)
- A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem (2012) (108)
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (2014) (105)
- Combining multicriteria analysis and tabu search for dial-a-ride problems (2013) (105)
- The Dynamic Uncapacitated Hub Location Problem (2011) (102)
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows (2001) (101)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (2008) (95)
- Heuristics for dynamic and stochastic inventory-routing (2014) (92)
- The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm (2009) (92)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (2012) (87)
- Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services (2011) (87)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (2009) (86)
- Long-Haul Vehicle Routing and Scheduling with Working Hour Rules (2013) (84)
- OPERATIONAL CAR ASSIGNMENT AT VIA RAIL CANADA (2000) (83)
- An incremental tabu search heuristic for the generalized vehicle routing problem with time windows (2012) (81)
- Integrated operations planning and revenue management for rail freight transportation (2010) (80)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (2008) (79)
- Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels (2012) (77)
- Transportation Demand (2019) (76)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (2015) (76)
- A large neighbourhood search heuristic for the aircraft and passenger recovery problem (2011) (73)
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions (2005) (73)
- The Hub Line Location Problem (2015) (73)
- SIMULTANEOUS LOCOMOTIVE AND CAR ASSIGNMENT AT VIA RAIL CANADA (1998) (71)
- A GRASP + ILP-based metaheuristic for the capacitated location-routing problem (2014) (71)
- Dynamic Facility Location with Generalized Modular Capacities (2015) (70)
- A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes (2014) (69)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (2007) (66)
- Iterated tabu search for the car sequencing problem (2008) (63)
- Robust uncapacitated hub location (2017) (63)
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (2010) (63)
- The diala-ride problem : models and algorithms (63)
- Solving a large multi-product production-routing problem with delivery time windows (2019) (62)
- Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem (2014) (62)
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem (2014) (62)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (2019) (61)
- A computational comparison of flow formulations for the capacitated location-routing problem (2013) (61)
- Chapter 7 Transportation on Demand (2007) (60)
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (2017) (59)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (2011) (58)
- Efficient Formulations and a Branch-and-Cut Algorithm for a Production-Routing Problem (2010) (58)
- Using Benders Decomposition to Implicitly Model Tour Scheduling (2002) (58)
- Measuring quality of service in dial-a-ride operations: the case of a Canadian city (2012) (57)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (2019) (56)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (2013) (54)
- The pickup and delivery problem with time windows and scheduled lines (2016) (53)
- Tactical network planning for food aid distribution in Kenya (2015) (53)
- A Memetic Heuristic for the Generalized Quadratic Assignment Problem (2006) (51)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (2009) (49)
- Simulation-based optimization for housekeeping in a container transshipment terminal (2015) (49)
- Scheduling identical parallel machines with tooling constraints (2015) (49)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (2008) (49)
- Designing a home-to-work bus service in a metropolitan area (2011) (48)
- Solving a dynamic facility location problem with partial closing and reopening (2016) (48)
- Exact and heuristic algorithms for the design of hub networks with multiple lines (2015) (47)
- Robust assembly line balancing with heterogeneous workers (2015) (47)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (2009) (46)
- An iterated local search heuristic for the logistics network design problem with single assignment (2008) (46)
- A tabu search heuristic for the generalized minimum spanning tree problem (2008) (45)
- An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays (2011) (45)
- Close-Point Spatial Tests and Their Application to Random Number Generators (2000) (44)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (2010) (43)
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (2008) (42)
- Steiner Tree Problems With Profits (2006) (42)
- Heuristics for dynamic and stochastic routing in industrial shipping (2013) (41)
- A column generation heuristic for a dynamic generalized assignment problem (2009) (41)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (2010) (41)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (2017) (40)
- Accelerating benders decomposition with heuristicmaster problem solutions (2012) (39)
- Optimizing yard assignment in an automotive transshipment terminal (2008) (39)
- A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks (2013) (38)
- A rolling horizon algorithm for auto-carrier transportation (2015) (37)
- An application of simulation to analyse resource sharing among health‐care organisations (2002) (37)
- The Delivery Man Problem with time windows (2010) (36)
- Modeling and solving a logging camp location problem (2012) (34)
- The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty (2016) (34)
- The Dial-a-Ride Problem: Variants, Modeling Issues and Algorithms (2002) (34)
- Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (2009) (31)
- The Attractive Traveling Salesman Problem (2010) (29)
- Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution (2019) (29)
- A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem (2016) (27)
- A practical time slot management and routing problem for attended home services (2017) (27)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (2009) (27)
- Rejoinder on: Static pickup and delivery problems: a classification scheme and survey (2007) (26)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (2020) (25)
- Waste collection inventory routing with non-stationary stochastic demands (2020) (24)
- A decomposition heuristic for a rich production routing problem (2018) (23)
- A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem (2010) (22)
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (2017) (20)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (2019) (20)
- Inventory routing under stochastic supply and demand (2020) (19)
- The impact of service level constraints in deterministic lot sizing with backlogging (2016) (19)
- Modeling and Optimization of Vehicle Routing and Arc Routing Problems (2006) (19)
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand (2013) (18)
- A BRANCH-AND-CUT ALGORITHM FOR THE CAPACITATED LOCATION-ROUTING PROBLEM (2010) (16)
- Dynamic and Stochastic Inventory-Routing (2012) (16)
- Modeling and Solving a Multimodal Routing Problem with Timetables and Time Windows (2008) (16)
- Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search (2011) (16)
- Solution approaches to large shift scheduling problems (2008) (15)
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (2015) (15)
- Vessel Service Planning in Seaports (2022) (15)
- A unified framework for rich routing problems with stochastic demands (2018) (14)
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (2017) (13)
- Entropy Tests for Random Number Generators (1997) (13)
- Adaptive large neighborhood search for integrated planning in railroad classification yards (2021) (12)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading (2007) (10)
- Multimodal hub network design with flexible routes (2021) (9)
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (2019) (8)
- A two-level simulated annealing algorithm for efficient dissemination of electronic content (2008) (8)
- Heuristics for electric taxi fleet management at Teo Taxi (2019) (7)
- Locating Satellite Yards in Forestry Operations (2009) (7)
- The Multi-Period Multi-Commodity Network Design Problem (2017) (7)
- Data-driven operations and supply chain management: established research clusters from 2000 to early 2020 (2021) (6)
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with (2007) (6)
- Decomposition methods for large-scale network expansion problems (2021) (6)
- Inventory routing with non-stationary stochastic demands (2016) (5)
- A branch-and-cut algorithm for an assembly routing problem (2018) (5)
- A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations (2022) (5)
- Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems (2018) (5)
- Exact Algorithms for the Multicommodity Uncapacitated Fixed-Charge Network Design Problem (2017) (4)
- Solving the vessel routing and scheduling problem at a Canadian maritime transportation company (2019) (4)
- Integrated inbound train split and load planning in an intermodal railway terminal (2021) (4)
- The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company (2021) (4)
- Profit-oriented fixed-charge network design with elastic demand (2019) (4)
- Metric inequalities , cutset inequalities and Benders feasibility cuts for multicommodity capacitated network design (2005) (4)
- Formulations and Solution Algorithms for a Dynamic Generalized Assignment Problem (2007) (4)
- Under demand uncertainty (2016) (3)
- Solving the Wire-Harness Design Problem at a European car manufacturer (2019) (3)
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (2020) (3)
- The transit time constrained fixed charge multi-commodity network design problem (2021) (3)
- A Decision Support System for Attended Home Services (2020) (3)
- BERTH ALLOCATION PROBLEM: APPLICATION TO THE GIOIA TAURO MARITIME TERMINAL (2003) (3)
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution (2022) (3)
- A time-space formulation for the locomotive routing problem at the Canadian National Railways (2021) (2)
- Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris (2022) (2)
- Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling (2020) (2)
- The doubly open park-and-loop routing problem (2022) (2)
- An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem (2021) (2)
- A Branch-and-Cut Algorithm for the Non-Preemptive Capacitated Swapping Problem (2008) (2)
- Integrating demand uncertainty in inventory routing for recyclable waste collection (2016) (1)
- Solving a Dynamic Facility Location Problem with an Application in Forestry (2014) (1)
- A matheuristic for the swap body vehicle routing problem (2020) (1)
- Solving the Pickup and Delivery Problem with Time Windows by Branch-and-Cut (2005) (1)
- Computer aided discovery of families of valid inequalities (2009) (1)
- A unified modeling and solution framework for stochastic routing problems (2017) (1)
- Vehicle routing and demand forecasting in recyclable waste collection (2015) (1)
- A two-stage stochastic collaborative intertwined supply network design problem under multiple disruptions (2023) (1)
- A Rolling Horizon Heuristic for Aircraft and Passenger Recovery (2016) (1)
- Measuring quality of service in dial-a-ride operations: the case of a Canadian city (2011) (1)
- SUPPLY CHAIN OPTIMIZATION BY BENDERS DECOMPOSITION (2003) (1)
- A general framework for routing problems with stochastic demands (2017) (1)
- AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-scale Capacitated Vehicle Routing Problem (2022) (1)
- A Heuristic for the Management of Multiple-Orbit Earth Observation Satellites (2005) (1)
- Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows (2015) (1)
- Modeling and solving a logging camp location problem (2012) (1)
- One-warehouse multi-retailer problem (2018) (0)
- A Guide to Vehicle Routing Heuristics Author ( s ) : (2007) (0)
- A Vehicle Routing Problem with Time Windows and Workload Balancing for COVID-19 Testers: A Case Study (2022) (0)
- The Load Planning and Sequencing Problem for Double-Stack Intermodal Trains (2019) (0)
- The load planning and sequencing problem for double-stack trains (2022) (0)
- A Learning Large Neighborhood Search for The Dynamic Electric Autonomous Dial-A-Ride Problem (2019) (0)
- Minimizing Entropy to Discover Good Solutions to Recurrent Mixed Integer Programs (2022) (0)
- Optimizing the standardization of car cables , proceedings of the 18 th annual congress of the french operations research society (2017) (0)
- Vessel service planning in seaports Online supplement (2021) (0)
- Vessel service planning in seaports Online supplement (2021) (0)
- Simultaneous object placement and request routing in content distribution networks (2006) (0)
- A matheuristic for the swap body vehicle routing problem (2019) (0)
- Solving the Park-and-Loop Routing Problem by Branch-Price-And-Cut (2023) (0)
- Intermodal Hub Network Design with Generalized Capacity Constraints and Non-Synchronized Train-Truck Operations (2022) (0)
- Optimizing the standardization of car cables (2017) (0)
- Robust Inventory Routing under Demand Uncertainty O ğ (2010) (0)
- A General Variable Neighborhood Search Heuristic for the Traveling Salesman Problem with Time Windows under Completion Time Minimization (2019) (0)
- Multi-product production routing under decoupled planning periods (2020) (0)
- Exact Algorithms for Multicommmodity Uncapacitated Fixed-charge Network Design (2018) (0)
- The consistent production routing problem (2022) (0)
- Strategic Planning at Kruger Products (2007) (0)
- Les Cahiers du GERAD ISSN : 0711 – 2440 New Heuristics for the Vehicle Routing Problem (2004) (0)
- Scale Network Expansion Problems (2019) (0)
- Les Cahiers du GERAD ISSN : 0711 – 2440 New Heuristics for the Vehicle Routing Problem (2004) (0)
- Column generation for the truck and trailer routing problem with time windows (2016) (0)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (2010) (0)
- Heuristics for a Stochastic and Dynamic Routing Problem in Industrial Shipping (2011) (0)
- Chapter 1 TABU SEARCH HEURISTICS FOR THE VEHICLE ROUTING PROBLEM (2004) (0)
- The Dynamic Multi-Period Vehicle Routing Problem Report 5 (2009) (0)
- A GRASP + ILP-based metaheuristic for the capacitated location-routing problem (2013) (0)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (2011) (0)
- The Multi-period Prize-collecting Steiner Tree Problem with Budget Constraints (2020) (0)
- A MATHEMATICAL FORMULATION FOR THE LOCATION OF LOGGING CAMPS (2011) (0)
- Roadef 2007 Challenge (2007) (0)
- A predictive large neighborhood search for the dynamic electric autonomous dial-a-ride problem (2020) (0)
This paper list is powered by the following services:
