Year |
Citation |
Score |
2020 |
Bruck BP, Castegini F, Cordeau J, Iori M, Poncemi T, Vezzali D. A Decision Support System for Attended Home Services Interfaces. 50: 137-152. DOI: 10.1287/Inte.2020.1031 |
0.363 |
|
2020 |
Alvarez A, Cordeau J, Jans R, Munari P, Morabito R. Inventory routing under stochastic supply and demand Omega-International Journal of Management Science. 102304. DOI: 10.1016/J.Omega.2020.102304 |
0.523 |
|
2020 |
Gruson M, Cordeau J, Jans R. Benders Decomposition for a Stochastic Three-level Lot Sizing and Replenishment Problem with a Distribution Structure European Journal of Operational Research. DOI: 10.1016/J.Ejor.2020.09.019 |
0.499 |
|
2020 |
Alvarez A, Cordeau J, Jans R, Munari P, Morabito R. Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products European Journal of Operational Research. 283: 511-529. DOI: 10.1016/J.Ejor.2019.11.015 |
0.6 |
|
2020 |
Chitsaz M, Cordeau J, Jans R. A branch-and-cut algorithm for an assembly routing problem European Journal of Operational Research. 282: 896-910. DOI: 10.1016/J.Ejor.2019.10.007 |
0.527 |
|
2020 |
Markov I, Bierlaire M, Cordeau J, Maknoon Y, Varone S. Waste collection inventory routing with non-stationary stochastic demands Computers & Operations Research. 113: 104798. DOI: 10.1016/J.Cor.2019.104798 |
0.531 |
|
2020 |
Huber S, Cordeau J, Geiger MJ. A matheuristic for the swap body vehicle routing problem Or Spectrum. 42: 111-160. DOI: 10.1007/S00291-019-00570-Z |
0.539 |
|
2019 |
Trottier L, Cordeau J. Solving the vessel routing and scheduling problem at a Canadian maritime transportation company Infor. 57: 260-285. DOI: 10.1080/03155986.2018.1533213 |
0.468 |
|
2019 |
Kramer R, Cordeau J, Iori M. Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution Transportation Research Part E-Logistics and Transportation Review. 129: 162-174. DOI: 10.1016/J.Tre.2019.07.012 |
0.59 |
|
2019 |
Zetina CA, Contreras I, Cordeau J. Profit-oriented fixed-charge network design with elastic demand Transportation Research Part B-Methodological. 127: 1-19. DOI: 10.1016/J.Trb.2019.06.004 |
0.444 |
|
2019 |
Neves-Moreira F, Almada-Lobo B, Cordeau J, Guimarães L, Jans R. Solving a large multi-product production-routing problem with delivery time windows Omega-International Journal of Management Science. 86: 154-172. DOI: 10.1016/J.Omega.2018.07.006 |
0.539 |
|
2019 |
Cordeau J, Furini F, Ljubić I. Benders decomposition for very large scale partial set covering and maximal covering location problems European Journal of Operational Research. 275: 882-896. DOI: 10.1016/J.Ejor.2018.12.021 |
0.554 |
|
2019 |
Vié M, Zufferey N, Cordeau J. Solving the Wire-Harness Design Problem at a European car manufacturer European Journal of Operational Research. 272: 712-724. DOI: 10.1016/J.Ejor.2018.06.047 |
0.492 |
|
2019 |
Zetina CA, Contreras IA, Cordeau J. Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design Computers & Operations Research. 111: 311-324. DOI: 10.1016/J.Cor.2019.07.007 |
0.486 |
|
2019 |
Gruson M, Bazrafshan M, Cordeau J, Jans R. A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure Computers & Operations Research. 111: 297-310. DOI: 10.1016/J.Cor.2019.07.005 |
0.498 |
|
2018 |
Ghilas V, Cordeau J, Demir E, Woensel TV. Branch-and-price for the pickup and delivery problem with time windows and scheduled lines Transportation Science. 52: 1191-1210. DOI: 10.1287/Trsc.2017.0798 |
0.592 |
|
2018 |
Miranda PL, Cordeau J, Ferreira D, Jans R, Morabito R. A decomposition heuristic for a rich production routing problem Computers & Operations Research. 98: 211-230. DOI: 10.1016/J.Cor.2018.05.004 |
0.577 |
|
2017 |
Jena SD, Cordeau J, Gendron B. Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities Informs Journal On Computing. 29: 388-404. DOI: 10.1287/Ijoc.2016.0738 |
0.532 |
|
2017 |
Zetina CA, Contreras I, Cordeau J, Nikbakhsh E. Robust uncapacitated hub location Transportation Research Part B-Methodological. 106: 393-410. DOI: 10.1016/J.Trb.2017.06.008 |
0.493 |
|
2017 |
Bruck BP, Cordeau J, Iori M. A practical time slot management and routing problem for attended home services Omega-International Journal of Management Science. 81: 208-219. DOI: 10.1016/J.Omega.2017.11.003 |
0.528 |
|
2017 |
Gruson M, Cordeau J, Jans R. The impact of service level constraints in deterministic lot sizing with backlogging Omega-International Journal of Management Science. 79: 91-103. DOI: 10.1016/J.Omega.2017.08.003 |
0.438 |
|
2017 |
Gullhav AN, Cordeau J, Hvattum LM, Nygreen B. Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds European Journal of Operational Research. 259: 829-846. DOI: 10.1016/J.Ejor.2016.11.003 |
0.511 |
|
2017 |
Beezão AC, Cordeau J, Laporte G, Yanasse HH. Scheduling identical parallel machines with tooling constraints European Journal of Operational Research. 257: 834-844. DOI: 10.1016/J.Ejor.2016.08.008 |
0.458 |
|
2016 |
Solyali Ǒ, Cordeau JF, Laporte G. The impact of modeling on robust inventory management under demand uncertainty Management Science. 62: 1188-1201. DOI: 10.1287/Mnsc.2015.2183 |
0.477 |
|
2016 |
Jena SD, Cordeau JF, Gendron B. Solving a dynamic facility location problem with partial closing and reopening Computers and Operations Research. 67: 143-154. DOI: 10.1016/J.Cor.2015.10.011 |
0.558 |
|
2016 |
Sinclair K, Cordeau JF, Laporte G. A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem Computers and Operations Research. 65: 42-52. DOI: 10.1016/J.Cor.2015.06.014 |
0.521 |
|
2015 |
De Sá EM, Contreras I, Cordeau JF, De Camargo RS, De Miranda G. The hub line location problem Transportation Science. 49: 500-518. DOI: 10.1287/Trsc.2014.0576 |
0.573 |
|
2015 |
Jena SD, Cordeau JF, Gendron B. Dynamic facility location with generalized modular capacities Transportation Science. 49: 484-499. DOI: 10.1287/Trsc.2014.0575 |
0.529 |
|
2015 |
Yossiri A, Cordeau JF, Jans R. Benders decomposition for production routing under demand uncertainty Operations Research. 63: 851-867. DOI: 10.1287/Opre.2015.1401 |
0.548 |
|
2015 |
Martins De Sá E, Contreras I, Cordeau JF. Exact and heuristic algorithms for the design of hub networks with multiple lines European Journal of Operational Research. 246: 186-198. DOI: 10.1016/J.Ejor.2015.04.017 |
0.512 |
|
2015 |
Rancourt MÈ, Cordeau JF, Laporte G, Watkins B. Tactical network planning for food aid distribution in Kenya Computers and Operations Research. 56: 68-83. DOI: 10.1016/J.Cor.2014.10.018 |
0.683 |
|
2015 |
Cordeau JF, Legato P, Mazza RM, Trunfio R. Simulation-based optimization for housekeeping in a container transshipment terminal Computers and Operations Research. 53: 81-95. DOI: 10.1016/J.Cor.2014.08.001 |
0.405 |
|
2015 |
Thiongane B, Cordeau JF, Gendron B. Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem Computers and Operations Research. 53: 1-8. DOI: 10.1016/J.Cor.2014.07.013 |
0.438 |
|
2015 |
Cordeau JF, Laganà D, Musmanno R, Vocaturo F. A decomposition-based heuristic for the multiple-product inventory-routing problem Computers and Operations Research. 55: 153-166. DOI: 10.1016/J.Cor.2014.06.007 |
0.473 |
|
2015 |
Adulyasak Y, Cordeau JF, Jans R. The production routing problem: A review of formulations and solution algorithms Computers and Operations Research. 55: 141-152. DOI: 10.1016/J.Cor.2014.01.011 |
0.571 |
|
2015 |
Moreira MCO, Cordeau JF, Costa AM, Laporte G. Robust assembly line balancing with heterogeneous workers Computers and Industrial Engineering. 88: 254-263. DOI: 10.1016/J.Cie.2015.07.004 |
0.483 |
|
2014 |
Muter I, Cordeau JF, Laporte G. A branch-and-price algorithm for the multidepot vehicle routing problem with interdepot routes Transportation Science. 48: 425-441. DOI: 10.1287/Trsc.2013.0489 |
0.596 |
|
2014 |
Cordeau JF, Ghiani G, Guerriero E. Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem Transportation Science. 48: 46-58. DOI: 10.1287/Trsc.1120.0449 |
0.539 |
|
2014 |
Adulyasak Y, Cordeau JF, Jans R. Optimization-based adaptive large neighborhood search for the production routing problem Transportation Science. 48: 20-45. DOI: 10.1287/Trsc.1120.0443 |
0.549 |
|
2014 |
Adulyasak Y, Cordeau JF, Jans R. Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems Informs Journal On Computing. 26: 103-120. DOI: 10.1287/Ijoc.2013.0550 |
0.592 |
|
2014 |
Contardo C, Cordeau JF, Gendron B. An exact algorithm based on cut-and-column generation for the capacitated location-routing problem Informs Journal On Computing. 26: 88-102. DOI: 10.1287/Ijoc.2013.0549 |
0.583 |
|
2014 |
Sinclair K, Cordeau JF, Laporte G. Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem European Journal of Operational Research. 233: 234-245. DOI: 10.1016/J.Ejor.2013.08.034 |
0.517 |
|
2014 |
Coelho LC, Cordeau JF, Laporte G. Heuristics for dynamic and stochastic inventory-routing Computers and Operations Research. 52: 55-67. DOI: 10.1016/J.Cor.2014.07.001 |
0.507 |
|
2014 |
Contardo C, Cordeau JF, Gendron B. A GRASP + ILP-based metaheuristic for the capacitated location-routing problem Journal of Heuristics. 20: 1-38. DOI: 10.1007/S10732-013-9230-1 |
0.494 |
|
2013 |
Rancourt ME, Cordeau JF, Laporte G. Long-haul vehicle routing and scheduling with working hour rules Transportation Science. 47: 81-107. DOI: 10.1287/Trsc.1120.0417 |
0.772 |
|
2013 |
Bartolini E, Cordeau JF, Laporte G. An exact algorithm for the capacitated arc routing problem with deadheading demand Operations Research. 61: 315-327. DOI: 10.1287/opre.1120.1154 |
0.456 |
|
2013 |
Alba Martínez MA, Cordeau JF, Dell'Amico M, Iori M. A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks Informs Journal On Computing. 25: 41-55. DOI: 10.1287/Ijoc.1110.0489 |
0.585 |
|
2013 |
Paquette J, Cordeau JF, Laporte G, Pascoal MMB. Combining multicriteria analysis and tabu search for dial-a-ride problems Transportation Research Part B: Methodological. 52: 1-16. DOI: 10.1016/J.Trb.2013.02.007 |
0.701 |
|
2013 |
Contardo C, Cordeau JF, Gendron B. A computational comparison of flow formulations for the capacitated location-routing problem Discrete Optimization. DOI: 10.1016/J.Disopt.2013.07.005 |
0.442 |
|
2013 |
Tirado G, Hvattum LM, Fagerholt K, Cordeau JF. Heuristics for dynamic and stochastic routing in industrial shipping Computers and Operations Research. 40: 253-263. DOI: 10.1016/J.Cor.2012.06.011 |
0.491 |
|
2013 |
Bartolini E, Cordeau JF, Laporte G. Improved lower bounds and exact algorithm for the capacitated arc routing problem Mathematical Programming. 137: 409-452. DOI: 10.1007/s10107-011-0497-4 |
0.431 |
|
2012 |
Hemmelmayr VC, Cordeau JF, Crainic TG. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Computers & Operations Research. 39: 3215-3228. PMID 23483764 DOI: 10.1016/J.Cor.2012.04.007 |
0.53 |
|
2012 |
Costa AM, Cordeau JF, Gendron B, Laporte G. Accelerating Benders decomposition with heuristic master problem solutions Pesquisa Operacional. 32: 3-19. DOI: 10.1590/S0101-74382012005000005 |
0.545 |
|
2012 |
Contreras I, Cordeau JF, Laporte G. Exact solution of large-scale hub location problems with multiple capacity levels Transportation Science. 46: 439-459. DOI: 10.1287/Trsc.1110.0398 |
0.537 |
|
2012 |
Solyali O, Cordeau JF, Laporte G. Robust inventory routing under demand uncertainty Transportation Science. 46: 327-340. DOI: 10.1287/Trsc.1110.0387 |
0.547 |
|
2012 |
Berbeglia G, Cordeau JF, Laporte G. A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem Informs Journal On Computing. 24: 343-355. DOI: 10.1287/Ijoc.1110.0454 |
0.757 |
|
2012 |
Moccia L, Cordeau JF, Laporte G. An incremental tabu search heuristic for the generalized vehicle routing problem with time windows Journal of the Operational Research Society. 63: 232-244. DOI: 10.1057/Jors.2011.25 |
0.568 |
|
2012 |
Coelho LC, Cordeau JF, Laporte G. Consistency in multi-vehicle inventory-routing Transportation Research Part C: Emerging Technologies. 24: 270-287. DOI: 10.1016/J.Trc.2012.03.007 |
0.564 |
|
2012 |
Crevier B, Cordeau JF, Savard G. Integrated operations planning and revenue management for rail freight transportation Transportation Research Part B: Methodological. 46: 100-119. DOI: 10.1016/J.Trb.2011.09.002 |
0.397 |
|
2012 |
Stålhane M, Andersson H, Christiansen M, Cordeau JF, Desaulniers G. A branch-price-and-cut method for a ship routing and scheduling problem with split loads Computers and Operations Research. 39: 3361-3375. DOI: 10.1016/J.Cor.2012.04.021 |
0.564 |
|
2012 |
Hemmelmayr VC, Cordeau JF, Crainic TG. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics Computers and Operations Research. 39: 3215-3228. DOI: 10.1016/j.cor.2012.04.007 |
0.427 |
|
2012 |
Coelho LC, Cordeau JF, Laporte G. The inventory-routing problem with transshipment Computers and Operations Research. 39: 2537-2548. DOI: 10.1016/J.Cor.2011.12.020 |
0.602 |
|
2012 |
Cordeau JF, Maischberger M. A parallel iterated tabu search heuristic for vehicle routing problems Computers and Operations Research. 39: 2033-2050. DOI: 10.1016/J.Cor.2011.09.021 |
0.567 |
|
2012 |
Paquette J, Bellavance F, Cordeau JF, Laporte G. Measuring quality of service in dial-a-ride operations: The case of a Canadian city Transportation. 39: 539-564. DOI: 10.1007/S11116-011-9375-4 |
0.523 |
|
2012 |
Jena SD, Cordeau JF, Gendron B. Modeling and solving a logging camp location problem Annals of Operations Research. 1-27. DOI: 10.1007/S10479-012-1278-Z |
0.509 |
|
2012 |
Parragh SN, Cordeau JF, Doerner KF, Hartl RF. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints Or Spectrum. 34: 593-633. DOI: 10.1007/S00291-010-0229-9 |
0.602 |
|
2011 |
Contreras I, Cordeau JF, Laporte G. The dynamic uncapacitated hub location problem Transportation Science. 45: 18-32. DOI: 10.1287/Trsc.1100.0326 |
0.54 |
|
2011 |
Contreras I, Cordeau JF, Laporte G. Benders decomposition for large-scale uncapacitated hub location Operations Research. 59: 1477-1490. DOI: 10.1287/Opre.1110.0965 |
0.495 |
|
2011 |
Perugia A, Moccia L, Cordeau JF, Laporte G. Designing a home-to-work bus service in a metropolitan area Transportation Research Part B: Methodological. 45: 1710-1726. DOI: 10.1016/J.Trb.2011.05.025 |
0.435 |
|
2011 |
Cordeau JF, Laporte G, Moccia L, Sorrentino G. Optimizing yard assignment in an automotive transshipment terminal European Journal of Operational Research. 215: 149-160. DOI: 10.1016/J.Ejor.2011.06.008 |
0.548 |
|
2011 |
Contreras I, Cordeau JF, Laporte G. Stochastic uncapacitated hub location European Journal of Operational Research. 212: 518-528. DOI: 10.1016/J.Ejor.2011.02.018 |
0.517 |
|
2011 |
Heilporn G, Cordeau JF, Laporte G. An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays Discrete Applied Mathematics. 159: 883-895. DOI: 10.1016/J.Dam.2011.01.021 |
0.539 |
|
2011 |
Bisaillon S, Cordeau JF, Laporte G, Pasin F. A large neighbourhood search heuristic for the aircraft and passenger recovery problem 4or. 9: 139-157. DOI: 10.1007/S10288-010-0145-5 |
0.456 |
|
2011 |
Maischberger M, Cordeau JF. Solving variants of the vehicle routing problem with a simple parallel iterated tabu search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6701: 395-400. DOI: 10.1007/978-3-642-21527-8_44 |
0.455 |
|
2011 |
Moccia L, Cordeau JF, Laporte G, Ropke S, Valentini MP. Modeling and solving a multimodal transportation problem with flexible-time and scheduled services Networks. 57: 53-68. DOI: 10.1002/Net.20383 |
0.578 |
|
2010 |
Erdoǧan G, Cordeau JF, Laporte G. The Attractive Traveling Salesman Problem European Journal of Operational Research. 203: 59-69. DOI: 10.1016/J.Ejor.2009.06.029 |
0.54 |
|
2010 |
Berbeglia G, Cordeau JF, Laporte G. Dynamic pickup and delivery problems European Journal of Operational Research. 202: 8-15. DOI: 10.1016/J.Ejor.2009.04.024 |
0.766 |
|
2010 |
Heilporn G, Cordeau JF, Laporte G. The Delivery Man Problem with time windows Discrete Optimization. 7: 269-282. DOI: 10.1016/J.Disopt.2010.06.002 |
0.578 |
|
2010 |
Erdoǧan G, Cordeau JF, Laporte G. A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem Discrete Applied Mathematics. 158: 1599-1614. DOI: 10.1016/J.Dam.2010.05.025 |
0.579 |
|
2010 |
Wen M, Cordeau JF, Laporte G, Larsen J. The dynamic multi-period vehicle routing problem Computers and Operations Research. 37: 1615-1623. DOI: 10.1016/J.Cor.2009.12.002 |
0.557 |
|
2010 |
Cordeau JF, Dell'Amico M, Iori M. Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading Computers and Operations Research. 37: 970-980. DOI: 10.1016/J.Cor.2009.08.003 |
0.533 |
|
2010 |
Cordeau JF, Laporte G, Pasin F, Ropke S. Scheduling technicians and tasks in a telecommunications company Journal of Scheduling. 13: 393-409. DOI: 10.1007/S10951-010-0188-7 |
0.474 |
|
2010 |
Rekik M, Cordeau JF, Soumis F. Implicit shift scheduling with multiple breaks and work stretch duration restrictions Journal of Scheduling. 13: 49-75. DOI: 10.1007/S10951-009-0114-Z |
0.351 |
|
2010 |
Dumitrescu I, Ropke S, Cordeau JF, Laporte G. The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm Mathematical Programming. 121: 269-305. DOI: 10.1007/S10107-008-0234-9 |
0.551 |
|
2010 |
Cordeau JF, Iori M, Laporte G, González JJS. A branch-and-cut algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO loading Networks. 55: 46-59. DOI: 10.1002/Net.V55:1 |
0.546 |
|
2009 |
Chan T, Cordeau JF, Laporte G. Locating satellite yards in forestry operations Infor. 47: 223-234. DOI: 10.3138/Infor.47.3.223 |
0.447 |
|
2009 |
Ropke S, Cordeau JF. Branch and cut and price for the pickup and delivery problem with time windows Transportation Science. 43: 267-286. DOI: 10.1287/Trsc.1090.0272 |
0.577 |
|
2009 |
Rei W, Cordeau JF, Gendreau M, Soriano P. Accelerating benders decomposition by local branching Informs Journal On Computing. 21: 333-345. DOI: 10.1287/Ijoc.1080.0296 |
0.452 |
|
2009 |
Wen M, Larsen J, Clausen J, Cordeau JF, Laporte G. Vehicle routing with cross-docking Journal of the Operational Research Society. 60: 1708-1718. DOI: 10.1057/Jors.2008.108 |
0.514 |
|
2009 |
Moccia L, Cordeau JF, Monaco MF, Sammarra M. A column generation heuristic for a dynamic generalized assignment problem Computers and Operations Research. 36: 2670-2681. DOI: 10.1016/J.Cor.2008.11.022 |
0.579 |
|
2009 |
Erdoǧan G, Cordeau JF, Laporte G. The pickup and delivery traveling salesman problem with first-in-first-out loading Computers and Operations Research. 36: 1800-1808. DOI: 10.1016/J.Cor.2008.05.005 |
0.53 |
|
2009 |
Paquette J, Cordeau JF, Laporte G. Quality of service in dial-a-ride operations Computers and Industrial Engineering. 56: 1721-1734. DOI: 10.1016/J.Cie.2008.07.005 |
0.534 |
|
2009 |
Stecco G, Cordeau JF, Moretti E. A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine Journal of Scheduling. 12: 3-16. DOI: 10.1007/S10951-008-0068-6 |
0.497 |
|
2009 |
Costa AM, Cordeau JF, Gendron B. Benders, metric and cutset inequalities for multicommodity capacitated network design Computational Optimization and Applications. 42: 371-392. DOI: 10.1007/S10589-007-9122-0 |
0.323 |
|
2009 |
Costa AM, Cordeau JF, Laporte G. Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints Networks. 53: 141-159. DOI: 10.1002/Net.V53:2 |
0.56 |
|
2008 |
Bekta T, Cordeau JF, Erkut E, Laporte G. A two-level simulated annealing algorithm for efficient dissemination of electronic content Journal of the Operational Research Society. 59: 1557-1567. DOI: 10.1057/Palgrave.Jors.2602490 |
0.436 |
|
2008 |
Rekik M, Cordeau JF, Soumis F. Solution approaches to large shift scheduling problems Rairo - Operations Research. 42: 229-258. DOI: 10.1051/Ro:2008006 |
0.508 |
|
2008 |
Cordeau JF, Laporte G, Pasin F. An iterated local search heuristic for the logistics network design problem with single assignment International Journal of Production Economics. 113: 626-640. DOI: 10.1016/J.Ijpe.2007.10.015 |
0.504 |
|
2008 |
Öncan T, Cordeau JF, Laporte G. A tabu search heuristic for the generalized minimum spanning tree problem European Journal of Operational Research. 191: 306-319. DOI: 10.1016/J.Ejor.2007.08.021 |
0.457 |
|
2008 |
Costa AM, Cordeau JF, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints European Journal of Operational Research. 190: 68-78. DOI: 10.1016/J.Ejor.2007.06.012 |
0.516 |
|
2008 |
Cordeau JF, Laporte G, Pasin F. Iterated tabu search for the car sequencing problem European Journal of Operational Research. 191: 945-956. DOI: 10.1016/J.Ejor.2007.04.048 |
0.465 |
|
2008 |
Bektaş T, Cordeau JF, Erkut E, Laporte G. Exact algorithms for the joint object placement and request routing problem in content distribution networks Computers and Operations Research. 35: 3860-3884. DOI: 10.1016/J.Cor.2007.02.005 |
0.542 |
|
2008 |
Stecco G, Cordeau JF, Moretti E. A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times Computers and Operations Research. 35: 2635-2655. DOI: 10.1016/J.Cor.2006.12.021 |
0.498 |
|
2008 |
Cordeau JF, Laporte G, Ropke S. Recent models and algorithms for one-to-one pickup and delivery problems Operations Research/ Computer Science Interfaces Series. 43: 327-357. DOI: 10.1007/978-0-387-77778-8_15 |
0.417 |
|
2007 |
Carrabs F, Cerulli R, Cordeau JF. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading Infor. 45: 223-238. DOI: 10.3138/Infor.45.4.223 |
0.558 |
|
2007 |
Paquette J, Cordeau J, Laporte G. Étude comparative de divers modèles pour le problème de transport à la demande Infor. 45: 95-110. DOI: 10.3138/Infor.45.2.95 |
0.564 |
|
2007 |
Paquette J, Cordeau JF, Laporte G. Comparative study of various models addressing the problem of transport on demand | Étude comparative de divers modèles pour le problème de transport à la demande Infor. 45: 95-110. DOI: 10.3138/infor.45.2.005 |
0.561 |
|
2007 |
Carrabs F, Cordeau JF, Laporte G. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading Informs Journal On Computing. 19: 618-632. DOI: 10.1287/Ijoc.1060.0202 |
0.474 |
|
2007 |
Cordeau JF, Gaudioso M, Laporte G, Moccia L. The service allocation problem at the Gioia Tauro Maritime Terminal European Journal of Operational Research. 176: 1167-1184. DOI: 10.1016/J.Ejor.2005.09.004 |
0.556 |
|
2007 |
Crevier B, Cordeau JF, Laporte G. The multi-depot vehicle routing problem with inter-depot routes European Journal of Operational Research. 176: 756-773. DOI: 10.1016/J.Ejor.2005.08.015 |
0.518 |
|
2007 |
Sammarra M, Cordeau JF, Laporte G, Monaco MF. A tabu search heuristic for the quay crane scheduling problem Journal of Scheduling. 10: 327-336. DOI: 10.1007/S10951-007-0029-5 |
0.591 |
|
2007 |
Cordeau JF, Laporte G. The dial-a-ride problem: Models and algorithms Annals of Operations Research. 153: 29-46. DOI: 10.1007/S10479-007-0170-8 |
0.544 |
|
2007 |
Ropke S, Cordeau JF, Laporte G. Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks. 49: 258-272. DOI: 10.1002/Net.V49:4 |
0.528 |
|
2006 |
Cordeau JF. A branch-and-cut algorithm for the dial-a-ride problem Operations Research. 54: 573-586. DOI: 10.1287/opre.1060.0283 |
0.411 |
|
2006 |
Cordeau JF, Gaudioso M, Laporte G, Moccia L. A memetic heuristic for the generalized quadratic assignment problem Informs Journal On Computing. 18: 433-443. DOI: 10.1287/Ijoc.1040.0128 |
0.482 |
|
2006 |
Costa AM, Cordeau JF, Laporte G. Steiner tree problems with profits Infor. 44: 99-115. DOI: 10.1080/03155986.2006.11732743 |
0.51 |
|
2006 |
Cordeau JF, Pasin F, Solomon MM. An integrated model for logistics network design Annals of Operations Research. 144: 59-82. DOI: 10.1007/S10479-006-0001-3 |
0.535 |
|
2006 |
Cordeau JF, Laporte G. Modeling and optimization of vehicle routing and arc routing problems International Series in Operations Research and Management Science. 88: 151-191. DOI: 10.1007/0-387-32942-0_6 |
0.386 |
|
2006 |
Moccia L, Cordeau JF, Gaudioso M, Laporte G. A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal Naval Research Logistics. 53: 45-59. DOI: 10.1002/Nav.20121 |
0.55 |
|
2005 |
Cordeau JF, Laporte G, Legato P, Moccia L. Models and tabu search heuristics for the berth-allocation problem Transportation Science. 39: 526-538. DOI: 10.1287/Trsc.1050.0120 |
0.492 |
|
2005 |
Cordeau JF, Laporte G. Maximizing the value of an earth observation satellite orbit Journal of the Operational Research Society. 56: 962-968. DOI: 10.1057/Palgrave.Jors.2601926 |
0.478 |
|
2005 |
Mercier A, Cordeau JF, Soumis F. A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem Computers and Operations Research. 32: 1451-1476. DOI: 10.1016/J.Cor.2003.11.013 |
0.575 |
|
2005 |
Cordeau JF, Gendreau M, Hertz A, Laporte G, Sormany JS. New heuristics for the vehicle routing problem Logistics Systems: Design and Optimization. 279-297. DOI: 10.1007/0-387-24977-X_9 |
0.417 |
|
2005 |
Cordeau JF, Laporte G. Tabu search heuristics for the vehicle routing problem Operations Research/ Computer Science Interfaces Series. 30: 145-163. |
0.449 |
|
2004 |
Cordeau JF, Laporte G, Mercier A. Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows Journal of the Operational Research Society. 55: 542-546. DOI: 10.1057/Palgrave.Jors.2601707 |
0.577 |
|
2004 |
Rekik M, Cordeau JF, Soumis F. Using benders decomposition to implicitly model tour scheduling Annals of Operations Research. 128: 111-133. DOI: 10.1023/B:Anor.0000019101.29692.2C |
0.54 |
|
2004 |
Attanasio A, Cordeau JF, Ghiani G, Laporte G. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem Parallel Computing. 30: 377-387. DOI: 10.1016/j.parco.2003.12.001 |
0.415 |
|
2003 |
Cordeau JF, Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research Part B: Methodological. 37: 579-594. DOI: 10.1016/S0191-2615(02)00045-0 |
0.498 |
|
2003 |
Cordeau JF, Laporte G. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms 4or. 1: 89-101. DOI: 10.1007/S10288-002-0009-8 |
0.54 |
|
2002 |
Cordeau J, Gendreau M, Laporte G, Potvin J, Semet F. A guide to vehicle routing heuristics Journal of the Operational Research Society. 53: 512-522. DOI: 10.1057/Palgrave.Jors.2601319 |
0.481 |
|
2002 |
Lingaya N, Cordeau JF, Desaulniers G, Desrosiers J, Soumis F. Operational car assignment at VIA Rail Canada Transportation Research Part B: Methodological. 36: 755-778. DOI: 10.1016/S0191-2615(01)00027-3 |
0.429 |
|
2001 |
Cordeau JF, Stojković G, Soumis F, Desrosiers J. Benders decomposition for simultaneous aircraft routing and crew scheduling Transportation Science. 35: 375-388. DOI: 10.1287/Trsc.35.4.375.10432 |
0.575 |
|
2001 |
Cordeau JF, Soumis F, Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains Operations Research. 49: 531-548. DOI: 10.1287/Opre.49.4.531.11226 |
0.535 |
|
2001 |
Cordeau JF, Laporte G. A tabu search algorithm for the site dependent vehicle routing problem with time windows Infor. 39: 292-298. DOI: 10.1080/03155986.2001.11732443 |
0.524 |
|
2001 |
Cordeau JF, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society. 52: 928-936. DOI: 10.1057/Palgrave.Jors.2601163 |
0.559 |
|
2001 |
Cordeau JF, Desaulniers G, Lingaya N, Soumis F, Desrosiers J. Simultaneous locomotive and car assignment at VIA Rail Canada Transportation Research Part B: Methodological. 35: 767-787. DOI: 10.1016/S0191-2615(00)00022-9 |
0.476 |
|
2000 |
Cordeau JF, Soumis F, Desrosiers J. Benders decomposition approach for the locomotive and car assignment problem Transportation Science. 34: 133-149. DOI: 10.1287/Trsc.34.2.133.12308 |
0.565 |
|
1998 |
Cordeau JF, Toth P, Vigo D. A survey of optimization models for train routing and scheduling Transportation Science. 32: 380-404. DOI: 10.1287/Trsc.32.4.380 |
0.478 |
|
1998 |
Banerjea-Brodeur M, Cordeau JF, Laporte G, Lasry A. Scheduling linen deliveries in a large hospital Journal of the Operational Research Society. 49: 777-780. DOI: 10.1057/Palgrave.Jors.2600581 |
0.393 |
|
1997 |
Cordeau JF, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks. 30: 105-119. DOI: 10.1002/(Sici)1097-0037(199709)30:2<105::Aid-Net5>3.0.Co;2-G |
0.566 |
|
Show low-probability matches. |