Submitted papers

    1. Markov, I., Bierlaire, M., Cordeau, J.-F., Maknoon, Y., Varone, S., “Waste Collection Inventory Routing with Non-stationary Stochastic Demands“, Computers & Operations Research, October 2018.
    2. Zetina, C.A., Contreras, I., Cordeau, J.-F., “Profit-oriented Fixed-charge Network Design with Elastic Demand“, Transportation Research Part B, October 2018.
    3. Alvarez, A., Cordeau, J.-F., 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, October 2018.
    4. Gruson, M., Bazrafshan, M., Cordeau, J.-F., Jans, R., “A Comparison of Formulations for a Three-level Lot Sizing and Replenishment Problem with a Distribution Structure“, Computers & Operations Research, October 2018.
    5. Zetina, C.A., Contreras, I., Cordeau, J.-F., “Exact Algorithms for Multicommodity Uncapacitated Fixed-charge Network Design Problem“, Computers & Operations Research, October 2018.
    6. Thevenin, S., Adulyasak, Y., Cordeau, J.-F., “Stochastic Optimization for Material Requirements Planning“, Production and Operations Management, August 2018.
    7. Chitsaz, M., Cordeau, J.-F., Jans, R., “A Branch-and-Cut Algorithm for an Assembly Routing Problem“, European Journal of Operational Research, July 2018.
    8. Kramer, R., Cordeau, J.-F., Iori, M., “Rich Vehicle Routing with Auxiliary Depots and Anticipated Deliveries: An Application to Pharmaceutical Distribution“, Omega, June 2018.
    9. Cordeau, J.-F., Furini, F., Ljubić, I., “Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems“, European Journal of Operational Research, June 2018.
    10. Huber, S., Cordeau, J.-F., Geiger, M., “A Matheuristic for the Swap-body Vehicle Routing Problem“, OR Spectrum, June 2018.
    11. Robinson La Rocca, C., Cordeau, J.-F., “Heuristics for Electric Taxi Fleet Management at Teo Taxi“, INFOR, November 2017.
    12. Fragkos, I., Cordeau, J.-F., Jans, R., “The Multi-Period Multi-Commodity Network Design Problem“, Transportation Science, October 2017.
Forthcoming papers
    1. Trottier, L.-P., Cordeau, J.-F., “Solving the Vessel Routing and Scheduling Problem at a Canadian Maritime Transportation Company”, INFOR.
    2. Chitsaz, M., Cordeau, J.-F., Jans, R., “A Unified Decomposition Matheuristic for Assembly, Production and Inventory Routing”, INFORMS Journal on Computing.
    3. Neves-Moreira, F., Almada-Lobo, B., Cordeau, J.-F., Guimarães, L., Jans, R., “Solving a Large Multi-product Production-Routing Problem with Delivery Time Windows”, Omega (DOI:10.1016/j.omega.2018.07.006).
Published papers
    1. Ghilas, V., Cordeau, J.-F., Demir, E., Van Woensel, T., “Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines”, Transportation Science 52, 1191-1210, 2018 (DOI:10.1287/trsc.2017.0798).
    2. Vié, M.-S., Zufferey, N., Cordeau, J.-F., “Solving the Wire-Harness Design Problem at a European Car Manufacturer”, European Journal of Operational Research 272, 712-724, 2018 (DOI:10.1016/j.ejor.2018.06.047).
    3. Bruck, B.P., Cordeau, J.-F., Iori, M., “A Practical Time Slot Management and Routing Problem in Attended Home Services”, Omega 81, 208-219 (DOI:10.1016/j.omega.2017.11.003).
    4. Miranda, P., Cordeau, J.-F., Ferreira, D., Jans, R., Morabito, R., “A Decomposition Heuristic for a Rich Production Routing Problem”, Computers & Operations Research 98, 211-230, 2018 (DOI:10.1016/j.cor.2018.05.004).
    5. Markov, I., Bierlaire, M., Cordeau, J.-F., Maknoon, Y., Varone, S., “A Unified Framework for Rich Routing Problems with Stochastic Demands”, Transportation Research Part B 114, 213-240, 2018 (DOI:10.1016/j.trb.2018.05.015).
    6. Gruson, M., Cordeau, J.-F., Jans, R., “The Impact of Service Level Constraints in Deterministic Lot Sizing with Backlogging”, Omega 79, 91-103, 2018 (DOI:10.1016/j.omega.2017.08.003).
    7. Zetina, C.A., Contreras, I., Cordeau, J.-F., Nikbakhsh, E., “Robust Uncapacitated Hub Location”, Transportation Research Part B 106, 393-410, 2017 (DOI:10.1016/j.trb.2017.06.008).
    8. Laurainne, P., Jobin, M.-H., Cordeau, J.-F., Becker, G., Shanti, A., Kurtz, J.-E., Gourieux, B., “Optimisation du parcours patient en hôpital de jour en oncohématologie par simulation intégrée à une démarche kaizen”, Logistique & Management 25, 34-42, 2017 (DOI:10.1080/12507970.2017.1316175).
    9. Jena, S.D., Cordeau, J.-F., Gendron, B., “Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities”, INFORMS Journal on Computing 29, 388-404, 2017 (DOI:10.1287/ijoc.2016.0738).
    10. Parragh, S.N., Cordeau, J.-F., “Branch-and-Price and Adaptive Large Neighborhood Search for the Truck and Trailer Routing Problem with Time Windows”, Computers & Operations Research 83, 28-44, 2017 (DOI:10.1016/j.cor.2017.01.020).
    11. Gullhav, A.N., Cordeau, J.-F., Hvattum, L.M., Nygreen, B., “Adaptive Large Neighborhood Search Heuristics for Multi-tier Deployment Problems in Clouds”, European Journal of Operational Research 259, 829-846, 2017 (DOI:10.1016/j.ejor.2016.11.003).
    12. Beezão, A.C., Cordeau, J.-F., Laporte, G., Yanasse, H.H., “Scheduling Identical Parallel Machines with Tooling Constraints”, European Journal of Operational Research 257, 834-844, 2017 (DOI:10.1016/j.ejor.2016.08.008).
    13. Solyali, O., Cordeau, J.-F., Laporte, G., “The Impact of Modeling on Robust Inventory Management under Demand Uncertainty”, Management Science 62, 1188-1201, 2016 (DOI:10.1287/mnsc.2015.2183).
    14. Jena, S.D., Cordeau, J.-F., Gendron, B., “Solving a Dynamic Facility Location Problem with Partial Closing and Reopening”, Computers & Operations Research 67, 143-154, 2016 (DOI:10.1016/j.cor.2015.10.011).
    15. Sinclair, K., Cordeau, J.-F., Laporte, G., “A Column Generation Post-Optimization Heuristic for the Integrated Aircraft and Passenger Recovery Problem”, Computers & Operations Research 65, 42-52, 2016 (DOI:10.1016/j.cor.2015.06.014).
    16. Moreira, M.C.O, Cordeau, J.-F., Costa, A.M., Laporte, G., “Robust Assembly Line Balancing with Heterogeneous Workers”, Computers & Industrial Engineering 88, 254-263, 2015 (DOI:10.1016/j.cie.2015.07.004).
    17. Adulyasak, Y., Cordeau, J.-F., Jans, R., “Benders Decomposition for Production Routing Under Demand Uncertainty”, Operations Research 63, 851-867, 2015 (DOI:10.1287/opre.2015.1401).
    18. Martins de Sá, E., Contreras, I., Cordeau, J.-F., de Camargo, R.S., de Miranda, G., “The Hub Line Location Problem”, Transportation Science 49, 500-518, 2015 (DOI:10.1287/trsc.2014.0576).
    19. Jena, S.D., Cordeau, J.-F., Gendron, B., “Dynamic Facility Location with Generalized Modular Capacities”, Transportation Science 49, 484-499, 2015 (DOI:10.1287/trsc.2014.0575).
    20. Jena, S.D., Cordeau, J.-F., Gendron, B., “Modeling and Solving a Logging Camp Location Problem”, Annals of Operations Research 232, 151-177, 2015 (DOI:10.1007/s10479-012-1278-z).
    21. Martins de Sá, E., Contreras, I., Cordeau, J.-F., “Exact and Heuristic Algorithms for the Design of Hub Networks with Multiple Lines”, European Journal of Operational Research 246, 186-198, 2015 (DOI:10.1016/j.ejor.2015.04.017).
    22. Cordeau, J.-F., Dell’Amico, M., Falavigna, S., Iori, M., “A Rolling Horizon Algorithm for Auto-Carrier Transportation”, Transportation Research Part B 76, 68-80, 2015 (DOI:10.1016/j.trb.2015.02.009).
    23. Rancourt, M.-E., Cordeau, J.-F., Laporte, G., Watkins, B., “Tactical Network Planning for Food Aid Distribution in Kenya”, Computers & Operations Research 56, 68-83, 2015 (DOI:10.1016/j.cor.2014.10.018).
    24. Cordeau, J.-F., Laganà, D., Musmanno, R., Vocaturo, F., “A Decomposition-Based Heuristic for a Multiple-Product Inventory Routing Problem”, Computers & Operations Research 55, 153-166, 2015 (DOI:10.1016/j.cor.2014.06.007).
    25. Adulyasak, Y., Cordeau, J.-F., Jans, R., “The Production Routing Problem: A Review of Formulations and Solution Algorithms”, Computers & Operations Research 55, 141-152, 2015 (DOI:10.1016/j.cor.2014.01.011).
    26. Cordeau, J.F., Legato, P., Mazza, R.M., Trunfio, R., “Simulation-Based Optimization for Housekeeping in a Container Transshipment Terminal”, Computers & Operations Research 53, 81-95, 2015 (DOI:10.1016/j.cor.2014.08.001).
    27. Thiongane, B., Cordeau, J.-F., Gendron, B., “Formulations for the Nonbifurcated Hop-Constrained Multicommodity Capacitated Fixed-Charge Network Design Problem”, Computers & Operations Research 53, 1-8, 2015 (DOI:10.1016/j.cor.2014.07.013).
    28. Battara, M., Cordeau, J.-F., Iori, M., “Pickup-and-Delivery Problems for Goods Transportation”, Vehicle Routing: Problems, Methods, and Applications, P. Toth, D. Vigo (eds), SIAM, Philadelphia, 161-191, 2014.
    29. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Heuristics for Dynamic and Stochastic Inventory-Routing”, Computers & Operations Research 52, 55-67, 2014 (DOI:10.1016/j.cor.2014.07.001).
    30. Muter, I., Cordeau, J.-F., Laporte, G., “A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes”, Transportation Science 48, 425-441, 2014 (DOI:10.1287/trsc.2013.0489).
    31. Contardo, C., Cordeau, J.-F., Gendron, B., “A GRASP + ILP-based Metaheuristic for the Capacitated Location-Routing Problem”, Journal of Heuristics 20, 1-28, 2014 (DOI:10.1007/s10732-013-9230-1).
    32. Contardo, C., Cordeau, J.-F., Gendron, B. “An Exact Method Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem”, INFORMS Journal on Computing 26, 88-102, 2014 (DOI:10.1287/ijoc.2013.0549).
    33. Adulyasak, Y., Cordeau, J.-F., Jans, R., “Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems”, INFORMS Journal on Computing 26, 103-120, 2014 (DOI:10.1287/ijoc.2013.0550).
    34. Coelho, L., Cordeau, J.-F., Laporte, G., “Thirty Years of Inventory Routing”, Transportation Science 48, 1-19, 2014 (DOI:10.1287/trsc.2013.0472).
    35. Adulyasak, Y., Cordeau, J.-F., Jans, R., “Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem”, Transportation Science 48, 20-45, 2014 (DOI:10.1287/trsc.1120.0443).
    36. Cordeau, J.-F., Ghiani, G., Guerriero, E., “Analysis and Branch-and-Cut Algorithm for the Time-Dependent Traveling Salesman Problem”, Transportation Science 48, 46-58, 2014 (DOI:10.1287/trsc.1120.0449).
    37. Sinclair, K., Cordeau, J.-F., Laporte, G., “Improvements to a Large Neighbourhood Search Heuristic for an Integrated Aircraft and Passenger Recovery Problem”, European Journal of Operational Research 233, 234-245, 2014 (DOI:10.1016/j.ejor.2013.08.034).
    38. Contardo, C., Cordeau, J.-F., Gendron, B. “A Computational Comparison of Flow Formulations for the Capacitated Location-Routing Problem”, Discrete Optimization 10, 263-295, 2013 (DOI:10.1016/j.disopt.2013.07.005).
    39. Alba Martínez, M.A., Cordeau, J.-F., 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, 2013.
    40. Paquette, J., Cordeau, J.-F., Laporte, G., Pascoal, M.M.B. “Combining Multicriteria Analysis and Tabu Search for Dial-a-Ride Problems”, Transportation Research Part B 52, 1-16, 2013.
    41. Bartolini, E., Cordeau, J.-F., Laporte, G., “An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand”, Operations Research 61, 315-327, 2013.
    42. Rancourt, M.-E., Cordeau, J.-F., Laporte, G., “Long-haul Vehicle Routing and Scheduling with Working Hour Rules”, Transportation Science 47, 81-107, 2013.
    43. Bartolini, E., Cordeau, J.-F., Laporte, G., “Improved Lower Bounds and Exact Algorithm for the Capacitated Arc Routing Problem”, Mathematical Programming Series A 137, 409-452, 2013.
    44. Tirado, G., Hvattum, L.M., Fagerholt, K., Cordeau, J.-F., “Heuristics for Dynamic and Stochastic Routing in Industrial Shipping”, Computers & Operations Research 40, 253-263, 2013.
    45. Contreras, I., Cordeau, J.-F., Laporte, G., “Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels”, Transportation Science 46, 439-459, 2012.
    46. Solyali, O., Cordeau, J.-F., Laporte, G., “Robust Inventory Routing under Demand Uncertainty”, Transportation Science 46, 327-340, 2012.
    47. Berbeglia, G., Cordeau, J.-F., Laporte, G., “A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem”, INFORMS Journal on Computing 24, 343-355, 2012.
    48. Parragh, S.N., Cordeau, J.-F., Doerner, K.F., Hartl, R.F., “Models and Algorithms for the Heterogeneous Dial-a-Ride Problem with Driver Related Constraints”, OR Spectrum 34, 593-633, 2012.
    49. Stalhane, M., Andersson, H., Christiansen, M., Cordeau, J.-F., Desaulniers, G., “A Branch-Price-and-Cut Method for a Ship Routing and Scheduling Problem with Split Loads”, Computers & Operations Research 39, 3361-3375, 2012.
    50. Hemmelmayr, V.C., Cordeau, J.-F., Crainic, T.G., “An Adaptive Large Neighborhood Search Heuristic for Two-Echelon Vehicle Routing Problems Arising in City Logistics”, Computers & Operations Research 39, 3215-3228, 2012.
    51. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Consistency in Multi-Vehicle Inventory-Routing”, Transportation Research Part C 24, 270-287, 2012.
    52. Costa, A.M., Cordeau, J.-F., Gendron, B., Laporte, G., “Accelerating Benders Decomposition with Heuristic Master Problem Solutions”, Pesquisa Operacional 32, 3-19, 2012.
    53. Paquette, J., Bellavance, F., Cordeau, J.-F., Laporte, G., “Measuring Quality of Service in Dial-a-Ride Operations: The Case of a Canadian City”, Transportation 39, 539-564, 2012.
    54. Coelho, L.C., Cordeau, J.-F., Laporte, G., “The Inventory-Routing Problem with Transshipment”, Computers & Operations Research 39, 2537-2548, 2012.
    55. Cordeau, J.-F., Maischberger, M., “A Parallel Iterated Tabu Search Heuristic for Vehicle Routing Problems”, Computers & Operations Research 39, 2033-2050, 2012.
    56. Moccia, L., Cordeau, J.-F., 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, 2012.
    57. Crevier, B., Cordeau, J.-F., Savard, G., “Integrated Operations Planning and Revenue Management for Rail Freight Transportation”, Transportation Research Part B 46, 100-119, 2012.
    58. Contreras, I., Cordeau, J.-F. Laporte, G.,”Benders Decomposition for Large-Scale Uncapacitated Hub Location”, Operations Research 59, 1477-1490, 2011.
    59. Perugia, A., Moccia, L., Cordeau, J.-F., Laporte, G., “Designing a Home-to-Work Bus Service in a Metropolitan Area”, Transportation Research Part B 45, 1710-1726, 2011.
    60. Cordeau, J.-F., Laporte, G., Moccia, L., Sorrentino, G., “Optimizing Yard Assignment in an Automative Transshipment Terminal”, European Journal of Operational Research 215, 149-160, 2011.
    61. Bisaillon, S., Cordeau, J.-F., Laporte, G., Pasin, F., “A Large Neighbourhood Search Heuristic for the Aircraft and Passenger Recovery Problem”, 4OR: A Quarterly Journal of Operations Research 9, 139-157, 2011.
    62. Contreras, I., Cordeau, J.-F., Laporte, G., “Stochastic Uncapacitated Hub Location”, European Journal of Operational Research 212, 518-528, 2011.
    63. Heilporn, G., Cordeau, J.-F., Laporte, G.,”An Integer L-Shaped Algorithm for the Dial-a-Ride Problem with Stochastic Customer Delays”, Discrete Applied Mathematics 159, 883-895, 2011.
    64. Contreras, I., Cordeau, J.-F., Laporte, G., “The Dynamic Uncapacitated Hub Location Problem”, Transportation Science 45, 18-32, 2011.
    65. Moccia, L., Cordeau, J.-F., Laporte, G., Ropke, S., Valentini, M.P., “Modeling and Solving a Multimodal Routing Problem with Flexible-Time and Scheduled Services”, Networks 57, 53-68, 2011.
    66. Erdogan, G., Cordeau, J.-F., Laporte, G., “A Branch-and-Cut Algorithm for Solving the Non-Preemptive Capacitated Swapping Problem”, Discrete Applied Mathematics 158, 1599-1614, 2010.
    67. Cordeau, J.-F., Laporte, G., Pasin, F., Ropke, S., “Scheduling Technicians and Tasks in a Telecommunications Company”, Journal of Scheduling 13, 393-409, 2010.
    68. Heilporn, G., Cordeau, J.-F.,Laporte, G., “The Delivery Man Problem with Time Windows”, Discrete Optimization 7, 269-282, 2010.
    69. Wen, M., Cordeau, J.-F., Laporte, G., Larsen, J., “The Dynamic Multi-Period Vehicle Routing Problem”, Computers & Operations Research 37, 1615-1623, 2010.
    70. Rekik, M., Cordeau, J.-F., Soumis, F., “Implicit Shift Scheduling with Multiple Breaks and Work Stretch Duration Restrictions”, Journal of Scheduling 13, 49-75, 2010.
    71. Cordeau, J.-F., Iori, M., Laporte, G., Salazar-González, J.-J., “A Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading”, Networks 55, 46-59, 2010.
    72. Cordeau, J.-F., Dell’Amico, M., Iori, M., “Branch-and-Cut for the Pickup and Delivery Traveling Salesman Problem with FIFO Loading”, Computers & Operations Research 37, 970-980, 2010.
    73. Erdogan, G., Cordeau, J.-F., Laporte, G., “The Attractive Traveling Salesman Problem”, European Journal of Operational Research 203, 59-69, 2010.
    74. Berbeglia, G., Cordeau, J-F., Laporte, G., “Dynamic Pickup and Delivery Problems”, European Journal of Operational Research 202, 8-15, 2010.
    75. Dumitrescu, I., Ropke, S., Cordeau, J.-F., Laporte, G., “The Traveling Salesman Problem with Pickup and Delivery: Polyhedral Results and a Branch-and-Cut Algorithm”, Mathematical Programming Series A 121, 269-305, 2010.
    76. Chan, T., Cordeau, J.-F., Laporte, G., “Locating Satellite Yards in Forestry Operations”, INFOR 47, 223-234, 2009.
    77. Wen, M., Larsen, J., Clausen, J., Cordeau, J.-F., Laporte, G., “Vehicle Routing with Cross-Docking”, Journal of the Operational Research Society 60, 1708-1718, 2009.
    78. Ropke, S., Cordeau, J.-F., “Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows”, Transportation Science 43, 267-286, 2009.
    79. Rei, W., Cordeau, J.-F., Gendreau, M., Soriano, P., “Accelerating Benders Decomposition by Local Branching”, INFORMS Journal on Computing 21, 333-345, 2009.
    80. Paquette, J., Cordeau, J.-F., Laporte, G., “Quality of Service in Dial-a-ride Operations”, Computers & Industrial Engineering 56, 1721-1734, 2009.
    81. Costa, A.M., Cordeau, J.-F., Gendron, B., “Benders, Metric and Cutset Inequalities for Multicommodity Capacitated Network Design”, Computational Optimization and Applications 42, 371-392, 2009.
    82. Moccia, L., Cordeau, J.-F., Monaco, M.F., Sammarra, M., “A Column Generation Heuristic for a Dynamic Generalized Assignment Problem”, Computers & Operations Research 36, 2670-2681, 2009.
    83. Costa, A.M., Cordeau, J.-F., Laporte, G., “Models and Branch-and-Cut Algorithms for the Steiner Tree Problem with Revenues, Budget and Hop Constraints”, Networks 53, 141-159, 2009.
    84. Stecco, G., Cordeau, J.-F., 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, 2009.
    85. Erdogan, G., Cordeau, J.-F., Laporte, G., “The Pickup and Delivery Traveling Salesman Problem with First-In-First-Out Loading”, Computers & Operations Research 36, 1800-1808, 2009.
    86. Bektas, T., Cordeau, J.-F., 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, 2008.
    87. Cordeau, J.-F., Laporte, G., Ropke, S., “Recent Models and Algorithms for One-to-One Pickup and Delivery Problems”, Vehicle Routing: Latest Advances and Challenges, B. L., Golden, S. Raghavan and E. A. Wasil (eds), Kluwer, Boston, 327-357, 2008.
    88. Cordeau, J.-F., Laporte, G., Pasin, F., “Iterated Tabu Search for the Car Sequencing Problem”, European Journal of Operational Research 191, 945-956, 2008.
    89. Rekik, M., Cordeau, J.-F., Soumis, F., “Solution Approaches to Large Shift Scheduling Problems”, RAIRO – Operations Research 42, 229-258, 2008.
    90. Cordeau, J.-F., 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, 2008.
    91. Oncan, T., Cordeau, J.-F., Laporte, G., “A Tabu Search Heuristic for the Generalized Minimum Spanning Tree Problem”, European Journal of Operational Research 191, 306-319, 2008.
    92. Bektas, T., Cordeau, J.-F., Erkut, E., Laporte, G., “Exact Algorithms for the Joint Object Placement and Request Routing Problem in Content Distribution Networks”, Computers & Operations Research 35, 3860-3884, 2008.
    93. Costa, A.M., Cordeau, J.-F., Laporte, G., “Fast Heuristics for the Steiner Tree Problem with Revenues, Budget and Hop Constraints”, European Journal of Operational Research 190, 68-78, 2008.
    94. Stecco, G., Cordeau, J.-F., Moretti, E., “A Branch-and-Cut Algorithm for a Production Scheduling Problem with Sequence-Dependent and Time-Dependent Setup Times”, Computers & Operations Research 35, 2635-2655, 2008.
    95. Carrabs, F., Cerulli, R., Cordeau, J.-F., “An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading”, INFOR 45, 223-238, 2007.
    96. Dubuc, G., Bektas, T., Cordeau, J.-F., Laporte, G., “Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique”, INFOR 45, 175-185, 2007.
    97. Paquette, J., Cordeau, J.-F., Laporte, G., “Étude comparative de divers modèles pour le problème de transport à la demande”, INFOR 45, 95-110, 2007.
    98. Gingras, C., Cordeau, J.-F., Laporte, G., “Un algorithme de minimisation du transport à vide appliqué à l’industrie forestière”, INFOR 45, 41-47, 2007.
    99. Carrabs, F., Cordeau, J.-F., Laporte, G., “Variable Neighbourhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading”, INFORMS Journal on Computing 19, 618-632, 2007.
    100. Sammarra, M., Cordeau, J.-F., Laporte, G., Monaco, M.F., “A Tabu Search Heuristic for the Quay Crane Scheduling Problem”, Journal of Scheduling 10, 327-336, 2007.
    101. Cordeau, J.-F., Laporte, G., “The Dial-a-Ride Problem: Models and Algorithms”, Annals of Operations Research 153, 29-46, 2007.
    102. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., “Static Pickup and Delivery Problems: A Classification Scheme and Survey”, TOP 15, 1-31, 2007.
    103. Ropke, S., Cordeau, J.-F., Laporte, G., “Models and a Branch-and-Cut Algorithm for Pickup and Delivery Problems with Time Windows”, Networks 49, 258-272, 2007.
    104. Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.P., Vigo, D., “Vehicle Routing”, Transportation, Handbooks in Operations Research and Management Science, Volume 14, C. Barnhart and G. Laporte (eds), Elsevier, Amsterdam, 367-428, 2007.
    105. Cordeau, J.-F., Laporte, G., Potvin, J.-Y., Savelsbergh, M.W.P., “Transportation on Demand”, Transportation, Handbooks in Operations Research and Management Science, Volume 14, C. Barnhart and G. Laporte (eds), Elsevier, Amsterdam, 429-466, 2007.
    106. Bianchessi, N., Cordeau, J.-F., Desrosiers, J., Laporte, G., Raymond, V., “A Heuristic for the Multi-Satellite, Multi-Orbit and Multi-User Management of Earth Observation Satellites”, European Journal of Operational Research 177, 750-762, 2007.
    107. Cordeau, J.-F., Gaudioso, M., Laporte, G., Moccia, L., “The Service Allocation Problem at the Gioia Tauro Maritime Terminal”, European Journal of Operational Research 176, 1167-1184, 2007.
    108. Crevier, B., Cordeau, J.-F., Laporte, G., “The Multi-Depot Vehicle Routing Problem with Inter-Depot Routes”, European Journal of Operational Research 176, 756-773, 2007.
    109. Cordeau, J.-F., Gaudioso, M., Laporte, G., Moccia, L., “A Memetic Heuristic for the Generalized Quadratic Assignment Problem”, INFORMS Journal on Computing 18, 433-443, 2006.
    110. Cordeau, J.-F., Pasin, F., Solomon, M.M., “An Integrated Model for Logistics Network Design”, Annals of Operations Research 144, 59-82, 2006.
    111. Costa, A.M., Cordeau, J.-F., Laporte, G., “Steiner Tree Problems with Profits”, INFOR 44, 99-115, 2006.
    112. Cordeau, J.-F., “A Branch-and-Cut Algorithm for the Dial-a-Ride Problem”, Operations Research 54, 573-586, 2006.