Jean-François Cordeau

Industrial and Manufacturing Engineering · 2000–2017

A researcher in the Science corpus: 18 papers; trusts 33 researchers and is trusted by 63 researchers here, as inferred from the citation graph.

Subfields

Industrial and Manufacturing Engineering — 66 citations into it; #14 of 2,521 by trust here, #46 by citations
Automotive Engineering — 28 citations into it; #17 of 3,081 by trust here, #456 by citations
Organizational Behavior and Human Resource Management — 15 citations into it; #5,865 of 8,741 by trust here, #5,837 by citations
Building and Construction — 9 citations into it; #94 of 2,909 by trust here, #378 by citations
Computer Vision and Pattern Recognition — 9 citations into it; #4,836 of 21,575 by trust here, #9,187 by citations
Transportation — 8 citations into it
Artificial Intelligence — 6 citations into it; #19,396 of 35,345 by trust here, #22,463 by citations
Control and Systems Engineering — 6 citations into it

Whom Jean-François Cordeau trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

Who trusts Jean-François Cordeau overall

Papers from Jean-François Cordeau's perspective

Ordered by how strongly the researchers Jean-François Cordeau trusts endorse each paper. Same corpus, a different order for every researcher.

The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (European Journal of Operational Research)
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation (Parallel Computing)
Solving the pickup and delivery problem with time windows using reactive tabu search
A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
On the shortest spanning subtree of a graph and the traveling salesman problem
The NP-Completeness Column: An Ongoing Guide
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Computers & Operations Research)
A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls

Their papers

Robust uncapacitated hub location (2017) — 97 citations
Thirty Years of Inventory Routing (2014) — 636 citations
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics (2012) — 534 citations
Dynamic pickup and delivery problems (2010) — 753 citations
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009) — 514 citations
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (2007) — 308 citations
Static pickup and delivery problems: a classification scheme and survey (2007) — 791 citations
The multi-depot vehicle routing problem with inter-depot routes (2007) — 342 citations
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (2006) — 744 citations
The dial-a-ride problem: models and algorithms (2006) — 956 citations
An integrated model for logistics network design (2006) — 312 citations
New Heuristics for the Vehicle Routing Problem (2005) — 300 citations
Models and Tabu Search Heuristics for the Berth-Allocation Problem (2005) — 425 citations
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms (2003) — 372 citations
A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem (2002) — 728 citations
A guide to vehicle routing heuristics (2002) — 681 citations
A unified tabu search heuristic for vehicle routing problems with time windows (2001) — 991 citations
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling (2000) — 346 citations