default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Cordeau
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j142]Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento
:
A hybrid adaptive iterated local search heuristic for the maximal covering location problem. Int. Trans. Oper. Res. 32(1): 176-193 (2025)- 2024
- [j141]Matthieu Gruson, Jean-François Cordeau, Raf Jans:
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem. Comput. Oper. Res. 161: 106434 (2024) - [j140]Arthur Mahéo, Simon Belieres, Yossiri Adulyasak, Jean-François Cordeau:
Unified Branch-and-Benders-Cut for two-stage stochastic mixed-integer programs. Comput. Oper. Res. 164: 106526 (2024) - [j139]Ali Kermani, Jean-François Cordeau, Raf Jans:
A progressive hedging-based matheuristic for the stochastic production routing problem with adaptive routing. Comput. Oper. Res. 169: 106745 (2024) - [j138]Roberto Baldacci, Stefano Coniglio, Jean-François Cordeau, Fabio Furini:
A Numerically Exact Algorithm for the Bin-Packing Problem. INFORMS J. Comput. 36(1): 141-162 (2024) - [j137]Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento:
AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem. INFORMS J. Comput. 36(4): 974-986 (2024) - [j136]Charly Robinson La Rocca, Jean-François Cordeau, Emma Frejinger:
One-Shot Learning for MIPs with SOS1 Constraints. Oper. Res. Forum 5(3): 57 (2024) - [j135]Fuliang Wu, Yossiri Adulyasak, Jean-François Cordeau:
Modeling and Solving the Traveling Salesman Problem with Speed Optimization for a Plug-In Hybrid Electric Vehicle. Transp. Sci. 58(3): 562-577 (2024) - 2023
- [j134]Jean-François Cordeau, Manuel Iori, Dario Vezzali:
A survey of attended home delivery and service problems with a focus on applications. 4OR 21(4): 547-583 (2023) - [j133]Simon Belieres, Yossiri Adulyasak, Jean-François Cordeau:
Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen. Comput. Oper. Res. 160: 106387 (2023) - [j132]Jean-François Cordeau, Manuel Iori, Nilson F. M. Mendes, Davide Nelli, Riccardo Tedeschi:
Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris. INFOR Inf. Syst. Oper. Res. 61(1): 104-140 (2023) - [j131]Karen R. Smilowitz, Jean-François Cordeau, Barrett W. Thomas, David Pisinger, Yafeng Yin, Ann M. Campbell:
Special Issue on Emerging Topics in Transportation Science and Logistics. Transp. Sci. 57(4): 839-842 (2023) - 2022
- [j130]Pedro L. Miranda, Jean-François Cordeau, Emma Frejinger:
A time-space formulation for the locomotive routing problem at the Canadian National Railways. Comput. Oper. Res. 139: 105629 (2022) - [j129]Nicolás Cabrera, Jean-François Cordeau, Jorge E. Mendoza:
The doubly open park-and-loop routing problem. Comput. Oper. Res. 143: 105761 (2022) - [j128]Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento:
An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Comput. Oper. Res. 148: 105954 (2022) - [j127]Duy Tan Nguyen, Yossiri Adulyasak, Jean-François Cordeau, Silvia I. Ponce:
Data-driven operations and supply chain management: established research clusters from 2000 to early 2020. Int. J. Prod. Res. 60(17): 5407-5431 (2022) - [j126]Simon Thevenin, Yossiri Adulyasak, Jean-François Cordeau:
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution. INFORMS J. Comput. 34(6): 3151-3169 (2022) - [j125]Lingxiao Wu, Yossiri Adulyasak, Jean-François Cordeau, Shuaian Wang:
Vessel Service Planning in Seaports. Oper. Res. 70(4): 2032-2053 (2022) - [j124]Moritz Ruf, Jean-François Cordeau, Emma Frejinger:
The load planning and sequencing problem for double-stack trains. J. Rail Transp. Plan. Manag. 23: 100337 (2022) - [j123]Aldair Alvarez, Jean-François Cordeau, Raf Jans:
The consistent production routing problem. Networks 80(3): 356-381 (2022) - [i1]Charly Robinson La Rocca, Emma Frejinger, Jean-François Cordeau:
Minimizing Entropy to Discover Good Solutions to Recurrent Mixed Integer Programs. CoRR abs/2202.06736 (2022) - 2021
- [j122]Erik Orm Hellsten, David Franz Koza, Iván A. Contreras, Jean-François Cordeau, David Pisinger:
The transit time constrained fixed charge multi-commodity network design problem. Comput. Oper. Res. 136: 105511 (2021) - [j121]Matthieu Gruson, Jean-François Cordeau, Raf Jans:
Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure. Eur. J. Oper. Res. 291(1): 206-217 (2021) - [j120]Camilo Ortiz-Astorquiza, Jean-François Cordeau, Emma Frejinger:
The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company. Transp. Sci. 55(2): 510-531 (2021) - 2020
- [j119]Iliya Markov, Michel Bierlaire, Jean-François Cordeau, Yousef Maknoon, Sacha Varone:
Waste collection inventory routing with non-stationary stochastic demands. Comput. Oper. Res. 113 (2020) - [j118]Claudia Archetti, Jean-François Cordeau, Guy Desaulniers:
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling. EURO J. Transp. Logist. 9(4): 100024 (2020) - [j117]Masoud Chitsaz, Jean-François Cordeau, Raf Jans:
A branch-and-cut algorithm for an assembly routing problem. Eur. J. Oper. Res. 282(3): 896-910 (2020) - [j116]Aldair Alvarez, Jean-François Cordeau, Raf Jans, Pedro Munari, Reinaldo Morabito:
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. Eur. J. Oper. Res. 283(2): 511-529 (2020) - [j115]Bruno Petrato Bruck, Filippo Castegini, Jean-François Cordeau, Manuel Iori, Tommaso Poncemi, Dario Vezzali:
A Decision Support System for Attended Home Services. INFORMS J. Appl. Anal. 50(2): 137-152 (2020) - [j114]Sandra Huber, Jean-François Cordeau, Martin Josef Geiger:
A matheuristic for the swap body vehicle routing problem. OR Spectr. 42(1): 111-160 (2020)
2010 – 2019
- 2019
- [j113]Matthieu Gruson, Majid Bazrafshan, Jean-François Cordeau, Raf Jans:
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. Comput. Oper. Res. 111: 297-310 (2019) - [j112]Carlos Armando Zetina, Iván A. Contreras, Jean-François Cordeau:
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. Comput. Oper. Res. 111: 311-324 (2019) - [j111]Marie-Sklaerder Vié, Nicolas Zufferey, Jean-François Cordeau:
Solving the Wire-Harness Design Problem at a European car manufacturer. Eur. J. Oper. Res. 272(2): 712-724 (2019) - [j110]Jean-François Cordeau, Fabio Furini, Ivana Ljubic:
Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275(3): 882-896 (2019) - [j109]Louis-Pierre Trottier, Jean-François Cordeau:
Solving the vessel routing and scheduling problem at a Canadian maritime transportation company. INFOR Inf. Syst. Oper. Res. 57(2): 260-285 (2019) - [j108]Charly Robinson La Rocca, Jean-François Cordeau:
Heuristics for electric taxi fleet management at Teo Taxi. INFOR Inf. Syst. Oper. Res. 57(4): 642-666 (2019) - [j107]Masoud Chitsaz, Jean-François Cordeau, Raf Jans:
A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing. INFORMS J. Comput. 31(1): 134-152 (2019) - 2018
- [j106]Pedro L. Miranda, Jean-François Cordeau, Deisemara Ferreira, Raf Jans, Reinaldo Morabito:
A decomposition heuristic for a rich production routing problem. Comput. Oper. Res. 98: 211-230 (2018) - [j105]Veaceslav Ghilas, Jean-François Cordeau, Emrah Demir, Tom Van Woensel:
Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. Transp. Sci. 52(5): 1191-1210 (2018) - 2017
- [j104]Sophie N. Parragh, Jean-François Cordeau:
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83: 28-44 (2017) - [j103]Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse:
Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257(3): 834-844 (2017) - [j102]Anders N. Gullhav, Jean-François Cordeau, Lars Magnus Hvattum, Bjørn Nygreen:
Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds. Eur. J. Oper. Res. 259(3): 829-846 (2017) - [j101]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities. INFORMS J. Comput. 29(3): 388-404 (2017) - 2016
- [j100]Karine Sinclair, Jean-François Cordeau, Gilbert Laporte:
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem. Comput. Oper. Res. 65: 42-52 (2016) - [j99]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Solving a dynamic facility location problem with partial closing and reopening. Comput. Oper. Res. 67: 143-154 (2016) - [j98]Oguz Solyali, Jean-François Cordeau, Gilbert Laporte:
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty. Manag. Sci. 62(4): 1188-1201 (2016) - 2015
- [j97]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Modeling and solving a logging camp location problem. Ann. Oper. Res. 232(1): 151-177 (2015) - [j96]Mayron César O. Moreira, Jean-François Cordeau, Alysson M. Costa, Gilbert Laporte:
Robust assembly line balancing with heterogeneous workers. Comput. Ind. Eng. 88: 254-263 (2015) - [j95]Babacar Thiongane, Jean-François Cordeau, Bernard Gendron:
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. Comput. Oper. Res. 53: 1-8 (2015) - [j94]Jean-François Cordeau, Pasquale Legato, Rina Mary Mazza, Roberto Trunfio:
Simulation-based optimization for housekeeping in a container transshipment terminal. Comput. Oper. Res. 53: 81-95 (2015) - [j93]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55: 141-152 (2015) - [j92]Jean-François Cordeau, Demetrio Laganà, Roberto Musmanno, Francesca Vocaturo:
A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 55: 153-166 (2015) - [j91]Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte, Ben Watkins:
Tactical network planning for food aid distribution in Kenya. Comput. Oper. Res. 56: 68-83 (2015) - [j90]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau:
Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246(1): 186-198 (2015) - [j89]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
Benders Decomposition for Production Routing Under Demand Uncertainty. Oper. Res. 63(4): 851-867 (2015) - [j88]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Dynamic Facility Location with Generalized Modular Capacities. Transp. Sci. 49(3): 484-499 (2015) - [j87]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
The Hub Line Location Problem. Transp. Sci. 49(3): 500-518 (2015) - 2014
- [j86]Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52: 55-67 (2014) - [j85]Karine Sinclair, Jean-François Cordeau, Gilbert Laporte:
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem. Eur. J. Oper. Res. 233(1): 234-245 (2014) - [j84]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20(1): 1-38 (2014) - [j83]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. INFORMS J. Comput. 26(1): 88-102 (2014) - [j82]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems. INFORMS J. Comput. 26(1): 103-120 (2014) - [j81]Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
Thirty Years of Inventory Routing. Transp. Sci. 48(1): 1-19 (2014) - [j80]Yossiri Adulyasak, Jean-François Cordeau, Raf Jans:
Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem. Transp. Sci. 48(1): 20-45 (2014) - [j79]Jean-François Cordeau, Gianpaolo Ghiani, Emanuela Guerriero:
Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem. Transp. Sci. 48(1): 46-58 (2014) - [j78]Ibrahim Muter, Jean-François Cordeau, Gilbert Laporte:
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes. Transp. Sci. 48(3): 425-441 (2014) - [p4]Maria Battarra, Jean-François Cordeau, Manuel Iori:
Pickup-and-Delivery Problems for Goods Transportation. Vehicle Routing 2014: 161-191 - 2013
- [j77]Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau:
Heuristics for dynamic and stochastic routing in industrial shipping. Comput. Oper. Res. 40(1): 253-263 (2013) - [j76]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A computational comparison of flow formulations for the capacitated location-routing problem. Discret. Optim. 10(4): 263-295 (2013) - [j75]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 J. Comput. 25(1): 41-55 (2013) - [j74]Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte:
An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Oper. Res. 61(2): 315-327 (2013) - [j73]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) - [j72]Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte:
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. Transp. Sci. 47(1): 81-107 (2013) - 2012
- [j71]Jean-François Cordeau, Mirko Maischberger:
A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39(9): 2033-2050 (2012) - [j70]Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11): 2537-2548 (2012) - [j69]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. Comput. Oper. Res. 39(12): 3215-3228 (2012) - [j68]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. Comput. Oper. Res. 39(12): 3361-3375 (2012) - [j67]Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS J. Comput. 24(3): 343-355 (2012) - [j66]Luigi Moccia, Jean-François Cordeau, Gilbert Laporte:
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63(2): 232-244 (2012) - [j65]Sophie N. Parragh, Jean-François Cordeau, Karl F. Doerner, Richard F. Hartl:
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectr. 34(3): 593-633 (2012) - [j64]Oguz Solyali, Jean-François Cordeau, Gilbert Laporte:
Robust Inventory Routing Under Demand Uncertainty. Transp. Sci. 46(3): 327-340 (2012) - [j63]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. Transp. Sci. 46(4): 439-459 (2012) - 2011
- [j62]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) - [j61]Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte:
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. Discret. Appl. Math. 159(9): 883-895 (2011) - [j60]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3): 518-528 (2011) - [j59]Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino:
Optimizing yard assignment in an automotive transshipment terminal. Eur. J. Oper. Res. 215(1): 149-160 (2011) - [j58]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
Benders Decomposition for Large-Scale Uncapacitated Hub Location. Oper. Res. 59(6): 1477-1490 (2011) - [j57]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) - [j56]Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte:
The Dynamic Uncapacitated Hub Location Problem. Transp. Sci. 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
- [j55]Jean-François Cordeau, Mauro Dell'Amico, Manuel Iori:
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 37(5): 970-980 (2010) - [j54]Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen:
The dynamic multi-period vehicle routing problem. Comput. Oper. Res. 37(9): 1615-1623 (2010) - [j53]Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. Discret. Appl. Math. 158(15): 1599-1614 (2010) - [j52]Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte:
The Delivery Man Problem with time windows. Discret. Optim. 7(4): 269-282 (2010) - [j51]Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1): 8-15 (2010) - [j50]Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
The Attractive Traveling Salesman Problem. Eur. J. Oper. Res. 203(1): 59-69 (2010) - [j49]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) - [j48]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) - [j47]Monia Rekik, Jean-François Cordeau, François Soumis:
Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Sched. 13(1): 49-75 (2010) - [j46]Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke:
Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4): 393-409 (2010)
2000 – 2009
- 2009
- [j45]Julie Paquette, Jean-François Cordeau, Gilbert Laporte:
Quality of service in dial-a-ride operations. Comput. Ind. Eng. 56(4): 1721-1734 (2009) - [j44]Alysson M. Costa, Jean-François Cordeau, Bernard Gendron:
Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42(3): 371-392 (2009) - [j43]Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput. Oper. Res. 36(6): 1800-1808 (2009) - [j42]Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra:
A column generation heuristic for a dynamic generalized assignment problem. Comput. Oper. Res. 36(9): 2670-2681 (2009) - [j41]Tuyva Chan, Jean-François Cordeau, Gilbert Laporte:
Locating Satellite Yards in Forestry Operations. INFOR Inf. Syst. Oper. Res. 47(3): 223-234 (2009) - [j40]Walter Rei, Jean-François Cordeau, Michel Gendreau, Patrick Soriano:
Accelerating Benders Decomposition by Local Branching. INFORMS J. Comput. 21(2): 333-345 (2009) - [j39]Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte:
Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12): 1708-1718 (2009) - [j38]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) - [j37]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. Sched. 12(1): 3-16 (2009) - [j36]Stefan Ropke, Jean-François Cordeau:
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. Transp. Sci. 43(3): 267-286 (2009) - 2008
- [j35]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. Comput. Oper. Res. 35(8): 2635-2655 (2008) - [j34]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. Comput. Oper. Res. 35(12): 3860-3884 (2008) - [j33]Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte:
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. Eur. J. Oper. Res. 190(1): 68-78 (2008) - [j32]Temel Öncan, Jean-François Cordeau, Gilbert Laporte:
A tabu search heuristic for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 191(2): 306-319 (2008) - [j31]Jean-François Cordeau, Gilbert Laporte, Federico Pasin:
Iterated tabu search for the car sequencing problem. Eur. J. Oper. Res. 191(3): 945-956 (2008) - [j30]Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte:
A two-level simulated annealing algorithm for efficient dissemination of electronic content. J. Oper. Res. Soc. 59(11): 1557-1567 (2008) - [j29]Monia Rekik, Jean-François Cordeau, François Soumis:
Solution approaches to large shift scheduling problems. RAIRO Oper. Res. 42(2): 229-258 (2008) - 2007
- [j28]Jean-François Cordeau, Gilbert Laporte:
The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1): 29-46 (2007) - [j27]Benoit Crevier, Jean-François Cordeau, Gilbert Laporte:
The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176(2): 756-773 (2007) - [j26]Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
The service allocation problem at the Gioia Tauro Maritime Terminal. Eur. J. Oper. Res. 176(2): 1167-1184 (2007) - [j25]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. Eur. J. Oper. Res. 177(2): 750-762 (2007) - [j24]Julie Paquette, Jean-François Cordeau, Gilbert Laporte:
Étude comparative de divers modèles pour le problème de transport à la demande. INFOR Inf. Syst. Oper. Res. 45(2): 95-110 (2007) - [j23]Ghislain Dubuc, Jean-François Cordeau, Gilbert Laporte, Tolga Bektas:
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique. INFOR Inf. Syst. Oper. Res. 45(3): 175-185 (2007) - [j22]Francesco Carrabs, Raffaele Cerulli, Jean-François Cordeau:
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading. INFOR Inf. Syst. Oper. Res. 45(4): 223-238 (2007) - [j21]Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte:
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS J. Comput. 19(4): 618-632 (2007) - [j20]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) - [p3]Jean-François Cordeau, Gilbert Laporte, Martin W. P. Savelsbergh, Daniele Vigo:
Chapter 6 Vehicle Routing. Transportation 2007: 367-428 - [p2]Jean-François Cordeau, Gilbert Laporte, Jean-Yves Potvin, Martin W. P. Savelsbergh:
Chapter 7 Transportation on Demand. Transportation 2007: 429-466 - 2006
- [j19]Jean-François Cordeau, Federico Pasin, Marius M. Solomon:
An integrated model for logistics network design. Ann. Oper. Res. 144(1): 59-82 (2006) - [j18]Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
A Memetic Heuristic for the Generalized Quadratic Assignment Problem. INFORMS J. Comput. 18(4): 433-443 (2006) - [j17]Jean-François Cordeau:
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. Oper. Res. 54(3): 573-586 (2006) - 2005
- [j16]Anne Mercier, Jean-François Cordeau, François Soumis:
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Comput. Oper. Res. 32: 1451-1476 (2005) - [j15]Jean-François Cordeau, Gilbert Laporte:
Maximizing the value of an Earth observation satellite orbit. J. Oper. Res. Soc. 56(8): 962-968 (2005) - [j14]Jean-François Cordeau, Gilbert Laporte, Pasquale Legato, Luigi Moccia:
Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transp. Sci. 39(4): 526-538 (2005) - 2004
- [j13]Monia Rekik, Jean-François Cordeau, François Soumis:
Using Benders Decomposition to Implicitly Model Tour Scheduling. Ann. Oper. Res. 128(1-4): 111-133 (2004) - [j12]Jean-François Cordeau, Gilbert Laporte, Anne Mercier:
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J. Oper. Res. Soc. 55(5): 542-546 (2004) - [j11]Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte:
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3): 377-387 (2004) - 2003
- [j10]Jean-François Cordeau, Gilbert Laporte:
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR 1(2): 89-101 (2003) - 2002
- [j9]Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet:
A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5): 512-522 (2002) - [p1]Jean-François Cordeau, Guy Desaulniers, Jacques Desrosiers, Marius M. Solomon, François Soumis:
VRP with Time Windows. The Vehicle Routing Problem 2002: 157-193 - 2001
- [j8]Jean-François Cordeau, François Soumis, Jacques Desrosiers:
Simultaneous Assignment of Locomotives and Cars to Passenger Trains. Oper. Res. 49(4): 531-548 (2001) - [j7]Jean-François Cordeau, Gilbert Laporte, Anne Mercier:
A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8): 928-936 (2001) - [j6]Jean-François Cordeau, Goran Stojkovic, François Soumis, Jacques Desrosiers:
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling. Transp. Sci. 35(4): 375-388 (2001) - 2000
- [j5]Pierre L'Ecuyer, Jean-François Cordeau, Richard J. Simard:
Close-Point Spatial Tests and Their Application to Random Number Generators. Oper. Res. 48(2): 308-317 (2000) - [j4]Jean-François Cordeau, François Soumis, Jacques Desrosiers:
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem. Transp. Sci. 34(2): 133-149 (2000)
1990 – 1999
- 1998
- [j3]M. Banerjea-Brodeur, Jean-François Cordeau, Gilbert Laporte, A. Lasry:
Scheduling linen deliveries in a large hospital. J. Oper. Res. Soc. 49(8): 777-780 (1998) - [j2]Jean-François Cordeau, Paolo Toth, Daniele Vigo:
A Survey of Optimization Models for Train Routing and Scheduling. Transp. Sci. 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)
Coauthor Index
[j103] [j100] [j98] [j96] [j91] [j86] [j85] [j81] [j78] [j74] [j73] [j72] [j70] [j67] [j66] [j64] [j63] [j62] [j61] [j60] [j59] [j58] [j57] [j56] [j54] [j53] [j52] [j51] [j50] [j49] [j48] [j46] [j45] [j43] [j41] [j39] [j38] [j34] [j33] [j32] [j31] [j30] [j28] [j27] [j26] [j25] [j24] [j23] [j21] [j20] [p3] [p2] [j18] [j15] [j14] [j12] [j11] [j10] [j9] [j7] [j3] [j1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
