- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j63 |      | Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau: Heuristics for dynamic and stochastic routing in industrial shipping. Computers & OR 40(1): 253-263 (2013) |
| j62 | | Manuel A. Alba Martínez, Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori: A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS Journal on Computing 25(1): 41-55 (2013) |
| j61 | | Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Operations Research 61(2): 315-327 (2013) |
| j60 | | Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte: Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math. Program. 137(1-2): 409-452 (2013) |
| j59 | | Marie-Eve Rancourt, Jean-François Cordeau, Gilbert Laporte: Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. Transportation Science 47(1): 81-107 (2013) |
| 2012 | ||
| j58 | | Jean-François Cordeau, Mirko Maischberger: A parallel iterated tabu search heuristic for vehicle routing problems. Computers & OR 39(9): 2033-2050 (2012) |
| j57 | | Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte: The inventory-routing problem with transshipment. Computers & OR 39(11): 2537-2548 (2012) |
| j56 | | Vera C. Hemmelmayr, Jean-François Cordeau, Teodor Gabriel Crainic: An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Computers & OR 39(12): 3215-3228 (2012) |
| j55 | | Magnus Stålhane, Henrik Andersson, Marielle Christiansen, Jean-François Cordeau, Guy Desaulniers: A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers & OR 39(12): 3361-3375 (2012) |
| j54 | | Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte: A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS Journal on Computing 24(3): 343-355 (2012) |
| j53 | | Luigi Moccia, Jean-François Cordeau, Gilbert Laporte: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. JORS 63(2): 232-244 (2012) |
| j52 | | Oguz Solyali, Jean-François Cordeau, Gilbert Laporte: Robust Inventory Routing Under Demand Uncertainty. Transportation Science 46(3): 327-340 (2012) |
| j51 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. Transportation Science 46(4): 439-459 (2012) |
| 2011 | ||
| j50 | | Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin: A large neighbourhood search heuristic for the aircraft and passenger recovery problem. 4OR 9(2): 139-157 (2011) |
| j49 | | Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte: An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. Discrete Applied Mathematics 159(9): 883-895 (2011) |
| j48 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: Stochastic uncapacitated hub location. European Journal of Operational Research 212(3): 518-528 (2011) |
| j47 | | Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino: Optimizing yard assignment in an automotive transshipment terminal. European Journal of Operational Research 215(1): 149-160 (2011) |
| j46 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: Benders Decomposition for Large-Scale Uncapacitated Hub Location. Operations Research 59(6): 1477-1490 (2011) |
| j45 | | Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini: Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1): 53-68 (2011) |
| j44 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: The Dynamic Uncapacitated Hub Location Problem. Transportation Science 45(1): 18-32 (2011) |
| c1 | | Mirko Maischberger, Jean-François Cordeau: Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search. INOC 2011: 395-400 |
| 2010 | ||
| j43 | | Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Computers & OR 37(5): 970-980 (2010) |
| j42 | | Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen: The dynamic multi-period vehicle routing problem. Computers & OR 37(9): 1615-1623 (2010) |
| j41 | | Günes Erdogan, Jean-François Cordeau, Gilbert Laporte: A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. Discrete Applied Mathematics 158(15): 1599-1614 (2010) |
| j40 | | Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte: The Delivery Man Problem with time windows. Discrete Optimization 7(4): 269-282 (2010) |
| j39 | | Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1): 8-15 (2010) |
| j38 | | Günes Erdogan, Jean-François Cordeau, Gilbert Laporte: The Attractive Traveling Salesman Problem. European Journal of Operational Research 203(1): 59-69 (2010) |
| j37 | | 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) |
| j36 | | Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1): 46-59 (2010) |
| j35 | | Monia Rekik, Jean-François Cordeau, François Soumis: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Scheduling 13(1): 49-75 (2010) |
| j34 | | Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke: Scheduling technicians and tasks in a telecommunications company. J. Scheduling 13(4): 393-409 (2010) |
| 2009 | ||
| j33 | | Julie Paquette, Jean-François Cordeau, Gilbert Laporte: Quality of service in dial-a-ride operations. Computers & Industrial Engineering 56(4): 1721-1734 (2009) |
| j32 | | Alysson M. Costa, Jean-François Cordeau, Bernard Gendron: Benders, metric and cutset inequalities for multicommodity capacitated network design. Comp. Opt. and Appl. 42(3): 371-392 (2009) |
| j31 | | 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) |
| j30 | | Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra: A column generation heuristic for a dynamic generalized assignment problem. Computers & OR 36(9): 2670-2681 (2009) |
| j29 | | 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) |
| j28 | | Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte: Vehicle routing with cross-docking. JORS 60(12): 1708-1718 (2009) |
| j27 | | 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) |
| j26 | | 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) |
| j25 | | 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 | ||
| j24 | | 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) |
| j23 | | 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) |
| j22 | | 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) |
| j21 | | 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) |
| j20 | | 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) |
| j19 | | Monia Rekik, Jean-François Cordeau, François Soumis: Solution approaches to large shift scheduling problems. RAIRO - Operations Research 42(2): 229-258 (2008) |
| 2007 | ||
| j18 | | Jean-François Cordeau, Gilbert Laporte: The dial-a-ride problem: models and algorithms. Annals OR 153(1): 29-46 (2007) |
| j17 | | 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) |
| j16 | | 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) |
| j15 | | 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) |
| j14 | | 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) |
| j13 | | 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 | ||
| j12 | | Jean-François Cordeau, Federico Pasin, Marius M. Solomon: An integrated model for logistics network design. Annals OR 144(1): 59-82 (2006) |
| j11 | | 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) |
| j10 | | Jean-François Cordeau: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. Operations Research 54(3): 573-586 (2006) |
| 2005 | ||
| j9 | | 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) |
| j8 | | 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 | ||
| j7 | | 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) |
| j6 | | 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 | ||
| j5 | | Jean-François Cordeau, Gilbert Laporte: The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR 1(2): 89-101 (2003) |
| 2001 | ||
| j4 | | 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 | ||
| j3 | | 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 | ||
| j2 | | 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 | ||
| j1 | | 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) |
Colors in the list of coauthors
Last update Sat May 25 08:33:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page