 | 2010 |
|---|
| 29 |       | Irina Dumitrescu,
Stefan Ropke,
Jean-François Cordeau,
Gilbert Laporte:
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
Math. Program. 121(2): 269-305 (2010) |
| 2009 |
|---|
| 28 | | Günes Erdogan,
Jean-François Cordeau,
Gilbert Laporte:
The pickup and delivery traveling salesman problem with first-in-first-out loading.
Computers & OR 36(6): 1800-1808 (2009) |
| 27 | | Walter Rei,
Jean-François Cordeau,
Michel Gendreau,
Patrick Soriano:
Accelerating Benders Decomposition by Local Branching.
INFORMS Journal on Computing 21(2): 333-345 (2009) |
| 26 | | Gabriella Stecco,
Jean-François Cordeau,
Elena Moretti:
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine.
J. Scheduling 12(1): 3-16 (2009) |
| 25 | | Alysson M. Costa,
Jean-François Cordeau,
Gilbert Laporte:
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.
Networks 53(2): 141-159 (2009) |
| 24 | | Stefan Ropke,
Jean-François Cordeau:
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows.
Transportation Science 43(3): 267-286 (2009) |
| 2008 |
|---|
| 23 | | Tolga Bektas,
Jean-François Cordeau,
Erhan Erkut,
Gilbert Laporte:
Exact algorithms for the joint object placement and request routing problem in content distribution networks.
Computers & OR 35(12): 3860-3884 (2008) |
| 22 | | Gabriella Stecco,
Jean-François Cordeau,
Elena Moretti:
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times.
Computers & OR 35(8): 2635-2655 (2008) |
| 21 | | Alysson M. Costa,
Jean-François Cordeau,
Gilbert Laporte:
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.
European Journal of Operational Research 190(1): 68-78 (2008) |
| 20 | | Temel Öncan,
Jean-François Cordeau,
Gilbert Laporte:
A tabu search heuristic for the generalized minimum spanning tree problem.
European Journal of Operational Research 191(2): 306-319 (2008) |
| 19 | | Jean-François Cordeau,
Gilbert Laporte,
Federico Pasin:
Iterated tabu search for the car sequencing problem.
European Journal of Operational Research 191(3): 945-956 (2008) |
| 2007 |
|---|
| 18 | | Jean-François Cordeau,
Gilbert Laporte:
The dial-a-ride problem: models and algorithms.
Annals OR 153(1): 29-46 (2007) |
| 17 | | Jean-François Cordeau,
Manlio Gaudioso,
Gilbert Laporte,
Luigi Moccia:
The service allocation problem at the Gioia Tauro Maritime Terminal.
European Journal of Operational Research 176(2): 1167-1184 (2007) |
| 16 | | Benoit Crevier,
Jean-François Cordeau,
Gilbert Laporte:
The multi-depot vehicle routing problem with inter-depot routes.
European Journal of Operational Research 176(2): 756-773 (2007) |
| 15 | | Nicola Bianchessi,
Jean-François Cordeau,
Jacques Desrosiers,
Gilbert Laporte,
Vincent Raymond:
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
European Journal of Operational Research 177(2): 750-762 (2007) |
| 14 | | Francesco Carrabs,
Jean-François Cordeau,
Gilbert Laporte:
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
INFORMS Journal on Computing 19(4): 618-632 (2007) |
| 13 | | Stefan Ropke,
Jean-François Cordeau,
Gilbert Laporte:
Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
Networks 49(4): 258-272 (2007) |
| 2006 |
|---|
| 12 | | Jean-François Cordeau,
Federico Pasin,
Marius M. Solomon:
An integrated model for logistics network design.
Annals OR 144(1): 59-82 (2006) |
| 11 | | Jean-François Cordeau,
Manlio Gaudioso,
Gilbert Laporte,
Luigi Moccia:
A Memetic Heuristic for the Generalized Quadratic Assignment Problem.
INFORMS Journal on Computing 18(4): 433-443 (2006) |
| 10 | | Jean-François Cordeau:
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem.
Operations Research 54(3): 573-586 (2006) |
| 2005 |
|---|
| 9 | | Anne Mercier,
Jean-François Cordeau,
François Soumis:
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem.
Computers & OR 32: 1451-1476 (2005) |
| 8 | | Jean-François Cordeau,
Gilbert Laporte,
Pasquale Legato,
Luigi Moccia:
Models and Tabu Search Heuristics for the Berth-Allocation Problem.
Transportation Science 39(4): 526-538 (2005) |
| 2004 |
|---|
| 7 | | Monia Rekik,
Jean-François Cordeau,
François Soumis:
Using Benders Decomposition to Implicitly Model Tour Scheduling.
Annals OR 128(1-4): 111-133 (2004) |
| 6 | | Andrea Attanasio,
Jean-François Cordeau,
Gianpaolo Ghiani,
Gilbert Laporte:
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem.
Parallel Computing 30(3): 377-387 (2004) |
| 2003 |
|---|
| 5 | | Jean-François Cordeau,
Gilbert Laporte:
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms.
4OR 1(2): 89-101 (2003) |
| 2001 |
|---|
| 4 | | Jean-François Cordeau,
Goran Stojkovic,
François Soumis,
Jacques Desrosiers:
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling.
Transportation Science 35(4): 375-388 (2001) |
| 2000 |
|---|
| 3 | | Jean-François Cordeau,
François Soumis,
Jacques Desrosiers:
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem.
Transportation Science 34(2): 133-149 (2000) |
| 1998 |
|---|
| 2 | | Jean-François Cordeau,
Paolo Toth,
Daniele Vigo:
A Survey of Optimization Models for Train Routing and Scheduling.
Transportation Science 32(4): 380-404 (1998) |
| 1997 |
|---|
| 1 | | Jean-François Cordeau,
Michel Gendreau,
Gilbert Laporte:
A tabu search heuristic for periodic and multi-depot vehicle routing problems.
Networks 30(2): 105-119 (1997) |
