Books

  1. Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.), “Location Science”, Springer, Berlin-Heidelberg, 2015, 644 pages.
  2. Corberán, Á, Laporte, G., (eds.), “Arc Routing: Problems, Methods and Applications”, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2014, 401 pages.
  3. Ghiani, G., Laporte, G., Musmanno, R., “Introduction to Logistics Systems Management”, Wiley, Chichester, 2013, 455 pages.
  4. Ghiani, G., Laporte, G., Musmanno, R., “Introduzione alla Gestione dei Sistemi Logistici”, Isedi, Torino, Italy, 2012, 450 pages.
  5. Barnhart, C., Laporte, G. (eds), “Transportation”, Handbooks in Operations Research and Management Science, Volume 14, Elsevier, Amsterdam, 2007, 783 pages.
  6. Eiselt, H. A., Laporte, G., Verter, V. (eds), “Location Analysis”, ISOLDE IX, Springer, Dordrecht, 2005, 349 pages.
  7. Ghiani, G., Laporte, G., Musmanno, R., “Introduction to Logistics Systems Planning and Control”, Wiley, Chichester, 2004, 352 pages.

 Published papers

  1. Liu, X., Laporte, G., Chen, Y., He, R., “An Adaptive Large Neighborhood Search Metaheuristic for Agile Satellite Scheduling with Time-Dependent Transition Time”, Computers & Operations Research, 86, 41-53, 2017.
  2. Franceschetti, A., Demir, E., Honhon, D., Van Woensel, T., Laporte, G., Stobbe, M., “A Metaheuristic for the Time-Dependent Pollution-Routing Problem”, European Journal of Operational Research, 259, 972-991, 2017.
  3. Lmariouh, J., Coelho, L.C., Elhachemi, N., Laporte, G., Jamali, A., Bouami, D., “Solving a Vendor-Managed Inventory Routing Problem Arising in the Distribution of Bottled Water in Morocco”, European Journal of Industrial Engineering, 11-168-184, 2017.
  4. Laporte, G., Ortega, F.A., Pozo, M.A., Puerto, J., “Multi-Objective Integration of Timetables, Vehicle Schedules and User Routings in a Transit Network”, Transportation Research, Part B, 98, 94-112, 2017.
  5. Silvestri, S., Laporte, G., Cerulli, R., “A Branch-and-Cut Algorithm for the Minimum Branch Vertices Spanning Tree Problem”, Computers & Operations Research, 81, 322-332, 2017.
  6. Veenstra, M., Cherkesly, M., Desaulniers, G., Laporte, G., “The Pickup and Delivery Problem with Time Windows and Handling Operations”, Computers & Operations Research, 77, 127-140, 2017.
  7. Canca, D., De Los Santos, A., Laporte, G., Mesa, J.A., “An Adaptive Neighborhood Search Metaheuristic for the Integrated Railway Rapid Transit Network Design and Line Planning Problem”, Computers & Operations Research, 78, 1-14, 2017.
  8. Maknoon, Y., Laporte, G., “Vehicle Routing with Cross-Dock Selection”, Computers & Operations Research, 77, 254-266, 2017.
  9. Gutiérrez-Jarpa, G., Laporte, G., Marianov, V., Moccia, L., “Multi-Objective Rapid Transit Network Design with Modal Competition: The Case of Conceptión, Chile”, Computers & Operations Research, 78, 27-43, 2017.
  10. Fernández-Cuesta, E., Andersson, H., Fagerholt, K., Laporte, G., “Vessel Routing with Selective Pickups and Deliveries: An Application to the Supply of Offshore Oil Platforms”, Computers & Operations Research, 79, 140-147, 2017.
  11. Franceschetti, A., Honhon, D., Laporte, G., Van Woensel, T., Fransoo, J.C., “Strategic Fleet Planning for City Logistics”, Transportation Research Part B, 95, 19-40, 2017.
  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(3), 834-844, 2017.
  13. Palomo-Martínez, P.J., Salazar-Aguilar, M.A., Laporte, G., Langevin, A., “A Hybrid Variable Neighborhood Search for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints”, Computers & Operations Research, 78, 408-419, 2017.
  14. Silvestri, S., Laporte, G., Cerulli, R., “The Rainbow Cycle Cover Problem”, Networks, 68, 260-270, 2016.
  15. Koç, C., Bektas, T., Jabali, O., Laporte, G., “A Comparison of Three Idling Options in Long-Haul Truck Scheduling”, Transportation Research Part B, 93, 631-647, 2016.
  16. Canca, D., Barrena, E., Laporte, G., Ortega, F.A., “A Short-Turning Policy for the Management of Demand Disruptions in Rapid Transit Systems”, Annals of Operations Research, 246(1), 145-166, 2016.
  17. Canca, D., De Los Santos, Laporte, G., Mesa, J.A., “A General Rapid Network Design, Line Planning and Fleet Investment Integrated Model”, Annals of Operations Research, 246(1), 127-144, 2016.
  18. Bakkehaug, R., Rakke, J.G., Fagerholt, K., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for Fleet Deployment Problems with Voyage Separation Requirements”, Transportation Research Part C, 70, 129-141, 2016.
  19. Falcón, R., Barrena, E., Canca, D., Laporte, G., “Counting and Enumerating Rotating Schedules by Using Gröbner Bases”, Mathematics and Computers in Simulation, 125, 139-151, 2016.
  20. Mauri, G.R., Ribeiro, G.M., Lorena, L.A.N., Laporte, G., “An Adaptive Large Neighborhood Search for the Discrete and Continuous Berth Allocation Problems”, Computers & Operations Research, 70, 140-154, 2016.
  21. Murat, A., Verter, V., Laporte, G., “A Global Shooting Algorithm for the Facility Location and Capacity Acquisition Problem on a Line with Dense Demand”, Computers & Operations Research, 71, 1-15, 2016.
  22. Erdogan, G., Laporte, G., Rodríguez-Chia, A.M., “Exact and Heuristic Algorithms for the Hamiltonian p-Median Problem”, European Journal of Operational Research, 253(2), 280-289, 2016.
  23. Hemmati, A., Hvattum, L.M., Christiansen, M., Laporte, “An Iterative Two-Phase Matheuristic for a Multi-Product Short-Sea Inventory-Routing Problem”, European Journal of Operational Research, 252(3), 775-788, 2016.
  24. François, B., Arda, Y., Crama, Y., Laporte, G., “Large Neighborhood Search for Multi-trip Vehicle Routing”, European Journal of Operational Research, 255(2), 422-441, 2016.
  25. Barrena, E., Laporte, G., Ortega, F.A., Pozo, M.A., “Determining Efficient Routes of Ecotourism in Nature Parks Under Environmental Constraints”, in Trends in Differential Equations and Applications, O. Gallego, F. Redondo Neble, M. Victoria, R. Galván, J. Rafael (Eds.), SEMA SIMAI Springer Series, 189-202, 2016.
  26. van Anholt, R.G., Coelho, L.C., Laporte, G., Vis, I.F.A., “An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines”, Transportation Science, 50(3), 1077-1091, 2016.
  27. Coelho, L.C., Renaud, J., Laporte, G., “Road-Based Goods Transportation: A Survey of Real-World Applications from 2000 to 2015”, INFOR, 54(2), 79-96, 2016.
  28. Ribeiro, G.M., Mauri, G.R., Beluco, S., Lorena, L.A.N., Laporte, G., “Berth Allocation in a Ore Terminal with Demurrage, Despatch and Maintenance”, Computers & Industrial Engineering, 96, 8-15, 2016.
  29. Solyali, O., Cordeau, J.-F., Laporte, G., “The Impact of Modeling on Robust Inventory Management under Demand Uncertainty”, Management Science, 62(4), 1188-1201, 2016.
  30. Crainic T.G., Laporte, “Transportation in supply chain management: recent advances and research prospects”, International Journal of Production Research, 54(2), 403-404, 2016.
  31. Pelletier, S., Jabali, O., Laporte, G., “Goods Distribution with Electric Vehicles: Review and Research Perspectives”, Transportation Science, 50(1), 3-22, 2016.
  32. Ortega, F.A., Barrena, E., Canca, D., Laporte, G., “Analyzing the Theoretical Capacity of Railway Networks with a Radial-Backbone Topology”, Transportation Reseach, Part A, 84, 83-92, 2016.
  33. Laporte, G., “Scheduling Issues in Vehicle Routing”, Annals of Operations Research, 236(2), 463-474, 2016.
  34. Cherkesly, M., Desaulniers, G., Irnich, S., Laporte, G., “Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Multiple Stacks”, European Journal of Operational Research, 250(3), 782-793, 2016.
  35. Lei, H., Wang, R., Laporte, G., “Solving a Multi-Objective Dynamic Stochastic Districting Routing Problem with a Co-Evolutionary Algorithm”, Computers & Operations Research, 67, 12-24, 2016.
  36. 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.
  37. Koç, C., Bektas, T., Jabali, O., Laporte, G., “The impact of depot location, fleet composition and routing on emissions in city logistics”, Transportation Research Part B, 84, 81-102, 2016.
  38. Koç, C., Bektas, T., Jabali, O., Laporte, G., “Thirty Years of Heterogeneous Vehicle Routing”, European Journal of Operational Research, 249(1), 1-21, 2016.
  39. Moccia, L., Laporte, G., “Improved Models for Technology Choice in a Transit Corridor with Fixed Demand”, Transportation Research, Part B, 83, 245-270, 2016.
  40. Koç, C., Bektas, T., Jabali, O., Laporte, G., “The Fleet Size and Mix Location-Routing Problem with Time Windows: Formulations and a Heuristic Algorithm”, European Journal of Operational Research, 248(1), 33-51, 2016.
  41. Tas, D., Gendreau, M., Jabali, O., Laporte, G., “The Traveling Salesman Problem with Time-Dependent Service Times”, European Journal of Operational Research, 248(2), 372-383, 2016.
  42. Bektas, T., Demir, E., Laporte, G., “Green Vehicle Routing”, Green Transportation Logistics: The Quest for Win-Win Solutions, H.N. Psaraftis, ed., Springer, Cham, Switzerland, 243-265, 2016.
  43. Cabantous, L., Laporte, G., “ASP, The Art and Science of Practice: Academia-Industry Interfacing in Operations Research in Montréal”, Interfaces, 45(6), 554-566, 2015.
  44. Laporte, G., Meunier, F., Wolfler Calvo, R., “Shared Mobility Systems”, 4OR: A Quarterly Journal of Operations Research , 13(4), 341-360, 2015.
  45. Ghiami, Y., Van Woensel, T., Christiansen, M., Laporte, G., “A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem”, Lecture Notes in Computer Science, Springer, Cham, Switzerland, 91-104, 2015.
  46. Ortiz-Astorquiza, C., Contreras, I., Laporte, G., “Multi-Level Facility Location as the Maximization of a Submodular Set Function”, European Journal of Operational Research, 247, 1013-1016, 2015.
  47. Norlund, E.K., Gribkovskaia, I., Laporte, G., “Supply Vessel Planning under Cost, Environment and Robustness Considerations”, Omega, 57B, 271-281, 2015.
  48. Cherkesly, M., Desaulniers, G., Laporte, G., “Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading”, Transportation Science, 49(4), 752-766, 2015.
  49. 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.
  50. Gharehgozli, A.H., Laporte, G., Yu, Y., de Koster, R., “Scheduling Twin Yard Cranes in a Container Block”, Transportation Science, 49(3), 686-705, 2015.
  51. Koç, C., Bektas, T., Jabali, O., Laporte, G., “A Hybrid Evolutionary Algorithm for Heterogeneous Fleet Vehicle Routing Problems with Time Windows”, Computers & Operations Research, 64, 11-27, 2015.
  52. Laporte, G., Pascoal, M.M.B., “Path Based Algorithms for Metro Networks Design”, Computers & Operations Research, 62, 78-94, 2015.
  53. Cherkesly, M., Desaulniers, G., Laporte, G., “A Population-Based Metaheuristic for the Pickup and Delivery Problem with Time Windows and LIFO Loading”, Computers & Operations Research, 62, 23-35, 2015.
  54. Coelho, L.C., Laporte, G., “An Optimized Target Level Inventory Replenishment Policy for Vendor-Managed Inventory Systems”, International Journal of Production Research, 53(12), 3651-3660, 2015.
  55. Barrena, E., De Los Santos, A., Laporte, G., Mesa, J.A., “Transferability of Collective Transportation Line Networks from a Topological and Passenger Demand Perspective”, Networks and Heterogeneous Media, 10, 1-16, 2015.
  56. Ortíz-Astorquiza, C., Contreras, I., Laporte, G., “The Minimum Flow Cost Hamiltonian Cycle Problem: A Comparison of Formulations”, Discrete Applied Mathematics, 187, 140-154, 2015.
  57. Coelho, L.C., Laporte, G., “Classification, Models and Exact Algorithms for Multi-Compartment Delivery Problems”, European Journal of Operational Research, 242(3), 854-864, 2015.
  58. Lei, H., Laporte, G., Liu, Y., Zhang, T., “Dynamic design of sales territories”, Computers & Operations Research, 56, 84-92, 2015.
  59. Rancourt, M.-È., Cordeau, J.-F., Laporte, G., Watkins, B., “Tactical Network Planning for Food Aid Distribution in Kenya”, Computers & Operations Research, 56, 68-83, 2015.
  60. Bektas, T., Laporte, G., Vigo, D., “Integrated Vehicle Routing Problems”, Computers & Operations Research, 55, page 126, 2015.
  61. Laporte, G., Nickel, S., Saldanha da Gama, F., “Introduction to Location Science”, Location Science, G. Laporte, S. Nickel and F. Saldanha da Gama, eds., Springer, Berlin-Heidelberg, 1-18, 2015.
  62. Laporte, G., Mesa, J.A., “The Design Rapid Transit Networks””, Location Science, G. Laporte, S. Nickel and F. Saldanha da Gama, eds., Springer, Berlin-Heidelberg, 581-594, 2015.
  63. Lahyani, R., Coelho, L.C., Khemakhem, M., Laporte, G., Semet, F., “A Multi-Compartment Vehicle Routing Problem Arising in the Collection of Olive Oil in Tunisia”, Omega, 51, 1-10, 2015.
  64. Ghiani, G., Laporte, G., Manni, E., “Model-Based Automatic Neighborhood Design by Unsupervised Learning”, Computers & Operations Research, 54, 108-116, 2015.
  65. Laporte, G., “The Tube Challenge”, INFOR, 52(1), 10-13, 2014.
  66. Laporte, G., Ropke, S., Vidal, T., “Heuristics for the Vehicle Routing Problem”, in Vehicle Routing: Problems, Methods and Applications, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 87-116, 2014.
  67. Laporte, G., “The Undirected Chinese Postman Problem”, in Arc Routing: Problems, Methods and Applications, Á Corberán and G. Laporte, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 53-64, 2014.
  68. Ghiani, G., Laporte, G., “The Undirected Rural Postman Problem”, in Arc Routing: Problems, Methods and Applications, Á Corberán and G. Laporte, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 85-99, 2014.
  69. Corberán, Á, Laporte, G., “A Historical Perspective on Arc Routing”, in Arc Routing: Problems, Methods and Applications, Á Corberán and G. Laporte, eds., SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1-15, 2014.
  70. 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.
  71. Demir, E., Bektas, T., Laporte, G., “The Bi-Objective Pollution-Routing Problem”, European Journal of Operational Research, 232, 464-478, 2014.
  72. Salazar-Aguilar, M.A., Langevin, A., Laporte, G., “The Multi-District Team Orienteering Problem”, Computers & Operations Research, 41,76-82, 2014.
  73. Barrena, E., Canca, D., Coelho, L.C., Laporte, G., “Exact Formulations and Algorithm for the Train Timetabling Problem with Dynamic Demand”, Computers & Operations Research, 44, 66-74, 2014.
  74. De-Los-Santos, A., Laporte,  G., Mesa, J.A., Perea, F., “Simultaneous Frequency and Capacity Setting in Uncapacitated Metro Lines in Presence of a Competing Mode”, Transportation Research Procedia, 3, 289-298, 2014
  75. Demir, E., Bektas, T., Laporte, G., “A Review of Recent Research on Green Road Freight Transportation”, European Journal of Operational Research, 237, 775-793, 2014.
  76. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Thirty Years of Inventory Routing”, Transportation Science, 48, 1-19, 2014.
  77. Albareda-Sambola, M., Fernández, E., Laporte, G., “The Dynamic Vehicle Routing Problem with Probabilistic Information” Computers & Operations Research, 48, 31-39, 2014.
  78. Erdogan, G., Battarra, M., Laporte, G., “Scheduling Twin Robots on a Line”, Naval Research Logistics, 61, 119-130, 2014.
  79. Coelho, L.C., Laporte, G., “Optimal Joint Replenishment, Delivery and Inventory Management Policies for Perishable Products”, Computers & Operations Research, 47, 42-52, 2014.
  80. Koç, Ç. Bektas, T., Jabali, O., Laporte, G., ““The Fleet Size and Mix Pollution-Routing Problem”, Transportation Research Part B, 70, 239-254, 2014.
  81. Belhaiza, S., Hansen, P., Laporte, G., “A Hybrid Variable Neighborhood Tabu Search Heuristic for the Vehicle Routing Problem with Multiple Time Windows” Computers & Operations Research, 52, Part B, 269-281, 2014.
  82. Muter, I., Cordeau, J.-F., Laporte, G., “A Branch-and-Price Algorithm for the Multi-Depot Vehicle Routing Problem with Inter-Depot Routes”, Transportation Science, 48, 425-441, 2014.
  83. Wen, M., Laporte, G., Madsen, O.B.G., Nørrelund, A.V., Olsen, A., “Locating Replenishment Stations for Electric Vehicles”, Journal of the Operational Research Society, 65, 1555-1561, 2014.
  84. Coelho, L.C., Laporte, G., “Improved Solutions for Inventory-Routing Problems through Valid Inequalities and Input Ordering”, International Journal of Production Economics, 155, 391-397, 2014.
  85. Coelho, L.C., Laporte, G., “A Comparison of Several Enumerative Algorithms for Sudoku”, Journal of the Operational Research Society, 65, 1602-1610, 2014.
  86. Perea, F., Mesa, J.A., Laporte, G., “Adding a New Station and a Road Link to a Road-Rail Network in the Presence of Modal Competition”, Transportation Research Part B, 68, 1-16, 2014.
  87. Butsch, A., Kalcsics, J., Laporte, G., “Districting for Arc Routing”, INFORMS Journal on Computing, 26, 809-824, 2014.
  88. Gollowitzer, S., Gouveia, L.E., Laporte, G., Pereira, D.L., Wojciechowski, A., “A Comparison of Several Models for the Hamiltonian p-Median Problem”, Networks, 63(4), 350-363, 2014.
  89. Erdogan, G., Laporte, G., Wolfler Calvo, R., “The Static Bicycle Relocation Problem with Demand Intervals”, European Journal of Operational Research, 238, 451-457, 2014.
  90. Jabali, O., Rei, W., Gendreau, M., Laporte, G., “Partial-Route Inequalities for the Multi-Vehicle Routing Problem with Stochastic Demands”, Discrete Applied Mathematics, 177, 121-136, 2014.
  91. Barrena, E., Canca, D., Coelho, L.C., Laporte, G., “Single-Line Rapid Transit Timetabling with Dynamic Passenger Demand”, Transportation Research Part B, 70, 134-150, 2014.
  92. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Heuristics for Dynamic and Stochastic Inventory-Routing”, Computers & Operations Research, 52, 55-67, 2014.
  93. Coelho, L.C., Laporte, G., “The Exact Solution of Several Classes of Inventory-Routing Problems”, Computers & Operations Research, 40, 558-565, 2013.
  94. Schmid, V., Doerner, K.F., Laporte, G., “Rich Routing Problems Arising in Supply Chain Management”, European Journal of Operational Research, 224, 435-448, 2013.
  95. Verma, M. Gendreau, M., Laporte, G., “Optimal Location and Capability of Oil Spill Response facilities for the South Coast of Newfoundland”, Omega, 41, 856-867, 2013.
  96. Erdogan, G., Laporte, G., “The Orienteering Problem with Variable Profits”, Networks, 61, 104-116, 2013.
  97. Rancourt, M.-È., Cordeau, J.-F., Laporte, G., “Long-Haul Vehicle Routing and Scheduling with Working Hour Rules”, Transportation Science, 47, 81-107, 2013.
  98. Bartolini, E., Cordeau, J.-F., Laporte, G., “Improved Lower Bounds and Exact Algorithm for the Capacitated Arc Routing Problem”, Mathematical Programming, 137, 409-452, 2013.
  99. Bartolini, E., Cordeau, J.-F., Laporte, G., “An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand”, Operations Research, 60, 315-327, 2013.
  100. 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.
  101. Salazar-Aguilar, M.A., Langevin, A., Laporte, G., “The Synchronized Arc and Node Routing Problem: Application to Road Marking”, Computers & Operations Research, 40, 1708-1715, 2013.
  102. Laporte, G., Toth, P., Vigo, D., “Vehicle Routing: Historical Perspective and Recent Contributions”, EURO Journal of Transportation and Logistics, 2, 1-4, 2013.
  103. Gutiérrez-Jarpa, G., Obreque, C., Laporte, G., Marianov, V., “Rapid Transit Network Design for Optimal Cost and Origin-Destination Demand Capture”, Computers & Operations Research, 40, 3000-3009, 2013
  104. Hvattum, L.M., Norstad, I., Fagerholt, K., Laporte, G., “Analysis of An Exact Algorithm for the Vessel Speed Optimization Problem”, Networks, 62, 132-135, 2013.
  105. Franceschetti, A., Honhon, D., Van Woensel, T., Bektas, T., Laporte, G., “The Time-Dependent Pollution-Routing Problem”, Transportation Research Part B, 56, 265-293, 2013.
  106. Barrena, E., De Los Santos, A., Laporte, G., Mesa, J.A., “Passenger Flow Connectivity in Collective Transportation Line Networks”, International Journal of Complex Systems in Science, 3, 1-10, 2013.
  107. Coelho, L.C., Laporte, G., “A Branch-and-Cut Algorithm for the Multi-Product Multi-Vehicle Inventory-Routing Problem”, International Journal of Production Research, 51, 7156-7169, 2013.
  108. Ribeiro, G.M., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for the Cumulative Capacitated Vehicle Routing Problem”, Computers & Operations Research, 39, 728-735, 2012.
  109. Erdogan, G., Battarra, M., Laporte, G., Vigo, D., “Metaheuristics for the Traveling Salesman Problem with Pickups, Deliveries and Handling Costs”, Computers & Operations Research, 39, 1074-1086, 2012.
  110. Salazar-Aguilar, M.A., Langevin, A., Laporte, G., “Synchronized Arc Routing for Snow Plowing Operations”, Computers & Operations Research, 39, 1432-1440, 2012.
  111. Qian, F., Gribkovskaia, I., Laporte, G., Halskau, Ø., “Passenger and Pilot Risk Minimization in Offshore Helicopter Transportation”, Omega, 40, 584-593, 2012.
  112. Rakke, J.G., Christiansen, M. Fagerholt, K., Laporte, G., “The Travelling Salesman Problem with Draft Limits”, Computers & Operations Research, 39, 2161-2167, 2012.
  113. 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.
  114. 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.
  115. Lei, H., Laporte, G., Guo, B., “A General Variable Neighborhood Search Heuristic for the Capacitated Vehicle Routing Problem with Stochastic Service Times”, TOP, 20, 99-118, 2012.
  116. Laporte, G., Pascoal, M.M.B., “The Pipeline and Valve Location Problem”, European Journal of Industrial Engineering, 6, 301-321, 2012.
  117. Coelho, L.C., Cordeau, J.-F., Laporte, G., “The Inventory-Routing Problem with Transshipment”, Computers & Operations Research, 39, 2537-2548, 2012.
  118. Ribeiro, G.M., Laporte, G., Mauri, G.R., “A Comparison of Three Metaheuristics for the Workover Rig Routing Problem”, European Journal of Operational Research, 220, 28-36, 2012.
  119. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Consistency in Inventory-Routing”, Transportation Research C, 24, 270-287, 2012.
  120. Costa, A. M., Cordeau, J.-F., Gendron, B., Laporte, G., “Accelerating Benders decomposition approach with heuristic master problem solutions”, Pesquisa Operacional, 32, 3-19, 2012.
  121. Lei, H., Laporte, G., Guo, B., “The Vehicle Routing Problem with Stochastic Demands and Split Deliveries”, INFOR, 50, 59-71, 2012.
  122. Lei, H., Laporte, G., Guo, B., “Districting for Routing with Stochastic Customers”, EURO Journal on Transportation and Logistics, 1, 67-85, 2012.
  123. Bordenave, C., Gendreau, M., Laporte, G., “A Branch-and-Cut Algorithm for the Preemptive Swapping Problem”, Networks, 59, 387-399, 2012.
  124. 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.
  125. Jabali, O., Gendreau, M., Laporte, G., “A Continuous Approximation Model for the Fleet Composition Problem”, Transportation Research Part B, 46, 1591-1606, 2012.
  126. Demir, E., Bektas, T., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for the Pollution-Routing Problem”, European Journal of Operational Research, 223, 346-359, 2012.
  127. 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.
  128. Jozefowiez, N., Laporte, G., Semet, F., “A Generic Branch-and-Cut Algorithm for Multi-Objective Optimization Problems: Application to the Multi-Modal Traveling Salesman Problem”, INFORMS Journal on Computing, 24, 554-564, 2012.
  129. Solyali, O., Cordeau, J.-F., Laporte, G., “Robust Inventory Routing under Demand Uncertainty”, Transportation Science, 46, 327-340, 2012.
  130. Limbourg, S. Schyns, M., Laporte, G., “Automatic Aircraft Cargo Load Planning”, Journal of the Operational Research Society, 63, 1271-1285, 2012.
  131. Duchenne, É., Laporte, G., Semet, F., “The Undirected m-Capacitated Peripatetic Salesman Problem”, European Journal of Operational Research, 223, 637-643, 2012.
  132. Shyshou, A., Gribkovskaia, I., Laporte, G., Fagerholt, K., “A Large Neighbourhood Search Heuristic for a Periodic Vessel Planning Problem Arising in Oil and Gas Operations”, INFOR, 50, 195-204, 2012.
  133. Laporte, G., Pascoal, M.M.B., “Minimum Cost Path Problems with Relays”, Computers & Operations Research 38, 165-173, 2011.
  134. Murat, A., Verter, V., Laporte, G., “A Multidimensional Shooting Algorithm for the Two-Facility Location-Allocation Problem with Dense Demand”, Computers & Operations Research 38, 450-463, 2011.
  135. Korsvik, J.E., Fagerholt, K., Laporte, G., “A Large Neighbourhood Search Heuristic for Ship Routing and Scheduling with Split Loads”, Computers & Operations Research 38, 474-483, 2011.
  136. Albareda-Sambola, M., Fernández, E., Laporte, G., “A Computational Comparison of Several Models for the Exact Solution of the Capacity and Distance Constrained Plant Location Problem”, Computers & Operations Research 38, 1109-1116, 2011.
  137. Moccia, L., Cordeau, J.-F., Laporte, G., Ropke, S., Valentini, M.P., “Modeling and Solving a Multimodal Routing Problem with Timetables and Time Windows”, Networks 57, 53-68, 2011.
  138. Laporte, G., Marín, A., Mesa, J.A., Perea, F., “Designing Robust Transit Networks with Alternative Routes”, Journal of Advanced Transportation, 45, 54-65, 2011.
  139. Contreras, I., Cordeau, J.-F., Laporte, G., “The Dynamic Uncapacitated Hub Location Problem”, Transportation Science, 45, 18-32, 2011.
  140. Jozefowiez, N., Laporte, G., Semet, F. “A Branch-and-Cut Algorithm for the Minimum Labeling Hamiltonian Cycle Problem and Two Variants”, Computers & Operations Research, 38, 1534-1542, 2011.
  141. 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.
  142. Contreras, I., Cordeau, J.-F., Laporte, G., “Stochastic Uncapacitated Hub Location”, European Journal of Operational Research, 212, 518-528, 2011.
  143. Demir, E., Bektas, T., Laporte, G., “A Comparative Analysis of Several Vehicle Emission Models for Freight Transportation”, Transportation Research D, 16, 347-357, 2011.
  144. Norstad, I., Fagerholt, K., Laporte, G., “Tramp Ship Routing and Scheduling with Speed Optimization”, Transportation Research C, 19, 853-865, 2011.
  145. Salazar-Aguilar, A., Langevin, A., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes, Lecture Notes in Computer Science, 6701, J. Pahl, T. Reiners, S. Voss (eds.), Berlin, 406-411, 2011.
  146. Bisaillon, S., Cordeau, J.-F., Laporte, G., Pasin, F., “A Large Neighbourhood Search Heuristic for the Aircraft and Passenger Recovery Problem”, 4OR, 9, 139-157, 2011.
  147. Lei, H., Laporte, G., Guo, B., “The Capacitated Vehicle Routing Problem with Stochastic Demands and Time Windows”, Computers & Operations Research, 38, 1175-1183, 2011.
  148. Laporte, G., Mesa, J.A., Ortega, F.A., Perea, F., “Planning Rapid Transit Systems”, Socio-Economic Planning Sciences, 45, 95-104, 2011.
  149. 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.
  150. Bektas, T., Laporte, G., “The Pollution-Routing Problem”, Transportation Research B, 45, 1232-1250, 2011.
  151. De Los Santos, A., Laporte, G., Mesa, J.A., Perea, F.,”Evaluating Passenger Robustness in a Railway Transit Network”, Transportation Research C, 20, 34-46, 2011.
  152. Anily, S., Gendreau, M., Laporte, G., “The Preemptive Swapping Problem on a Tree”, Networks, 58, 83-94, 2011.
  153. Perugia, A., Moccia, L., Cordeau, J.-F., Laporte, G., “Designing a Home-to-Work Bus Service in a Metropolitan Area”, Transportation Research B, 45, 1710-1726, 2011.
  154. Contreras, I., Cordeau, J.-F. Laporte, G.,”Benders Decomposition for Large-Scale Uncapacitated Hub Location”, Operations Research, 59, 1477-1490, 2011.
  155. Bozkaya, B., Erkut, E., Haight, D., Laporte, G., “Designing New Electoral Districts for the City of Edmonton”, Interfaces, 41, 534-547, 2011.
  156. Korsvik, J.E., Fagerholt, K., Laporte, G., “A Tabu Search Heuristic for Ship Routing and Scheduling”, Journal of the Operational Research Society” 61, 594-603, 2010.
  157. Laporte, G., “Supply Chain Management Research in Liege and Montreal”, Spirit of Management, 8, 44, 2010.
  158. Gutiérrez-Jarpa, G., Desaulniers, G., Laporte, G., Marianov, V., “A Branch-and-Price Algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows”, European Journal of Operational Research 206, 341-349, 2010.
  159. Baldacci, R., Bartolini, E., Laporte, G., “Some Applications of the Generalized Vehicle Routing Problem”, Journal of the Operational Research Society 61, 1072-1077, 2010.
  160. Ghiani, G., Laganà, D., Laporte, G., Mari, F., “Ant Colony Optimization for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions”, Journal of Heuristics 16, 211-233, 2010.
  161. Cordeau, J.-F., Laporte, G., Pasin, F., Ropke, S., “Scheduling Technicians and Tasks in a Telecommunications Company”, Journal of Scheduling 13, 393-409, 2010.
  162. Erdogan, G., Cordeau, J.-F., Laporte, G., “A Branch-and-Cut Algorithm for the Non-Preemptive Capacitated Swapping Problem”, Discrete Applied Mathematics 158, 1599-1614, 2010.
  163. Lima Pinto, L., Laporte, G., “An Efficient Algorithm for the Steiner Tree Problem with Revenue, Bottleneck and Hop Objective Functions”, European Journal of Operational Research 207, 45-49, 2010.
  164. Battarra, M., Erdogan, G., Laporte, G., Vigo, D., “The Traveling Salesman Problem with Pickups, Deliveries and Handling Costs”, Transportation Science 44, 383-399, 2010.
  165. Laporte, G., “The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization”, International Journal of Strategic Decision Sciences 2, 82-92, 2010.
  166. Laporte, G., “Comments on ‘Routing Problems with Loading Constraints’, by Manuel Iori and Silvano Martello”, TOP 18, 28-30, 2010.
  167. Heilporn, G., Cordeau, J.-F., Laporte, G., “The Delivery Man Problem with Time Windows”, Discrete Optimization 7, 269-282, 2010.
  168. Erdogan, G., Erkut, E., Ingolfsson, A., Laporte, G., “Scheduling Ambulance Crews for Maximum Coverage”, Journal of the Operational Research Society 61, 543-550, 2010.
  169. Fagerholt, K., Laporte, G., Norstad, I., “Reducing Fuel Emissions by Optimizing Speed on Shipping Routes”, Journal of the Operational Research Society 61, 523-529, 2010.
  170. Laporte, G., Musmanno, R., Vocaturo, F., “An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc Routing Problem with Stochastic Demands”, Transportation Science 44, 125-135, 2010.
  171. Laporte, G., Mesa, J.A., Perea, F., “A Game Theoretic Framework for the Robust Railway Network Design Problem”, Transportation Research B 44, 447-459, 2010.
  172. Wen, M., Cordeau, J.-F., Laporte, G., Larsen, J., “The Dynamic Multi-Period Vehicle Routing Problem”, Computers & Operations Research 37, 1615-1623, 2010.
  173. Touhami, S., Bourjolly, J.-M., Laporte, G., “Optimizing Hopping Sequences in Frequency Hopping Cellular Networks”, Engineering Optimization 42, 33-44, 2010.
  174. 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.
  175. Beaudry, A., Laporte, G., Melo, T., Nickel, S., “Dynamic Transportation of Patients in Hospitals”, Operations Research Spectrum 32, 77-107, 2010.
  176. Murat, A., Verter, V., Laporte, G., “A Continuous Analysis Framework for the Solution of Location-Allocation Problems with Dense Demands”, Computers & Operations Research 37, 123-136, 2010.
  177. Bordenave, C., Gendreau, M., Laporte, G., “Heuristics for the Mixed Swapping Problem”, Computers & Operations Research 37, 108-114, 2010.
  178. Laporte, G., “A Concise Guide to the Traveling Salesman Problem”, Journal of the Operational Research Society 61, 35-40, 2010.
  179. Erdogan, G., Cordeau, J.-F., Laporte, G., “The Attractive Traveling Salesman Problem”, European Journal of Operational Research 203, 59-69, 2010.
  180. Bolduc, M.-C., Laporte, G., Renaud, J., Boctor, F.F., “A Tabu Search Heuristic for the Split Delivery Vehicle Routing Problem with Production and Demand Calendars”, European Journal of Operational Research 202, 122-130, 2010.
  181. Berbeglia, G., Cordeau, J-F., Laporte, G., “Dynamic Pickup and Delivery Problems”, European Journal of Operational Research 202, 8-15, 2010.
  182. 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.
  183. Chan, T., Cordeau, J.-F., Laporte, G., “Locating Satellite Yards in Forestry Operations”, INFOR 47, 223-234, 2009.
  184. Laporte, G., “Fifty Years of Vehicle Routing”, Transportation Science 43, 408-416, 2009.
  185. 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.
  186. Berbeglia, G. “The Counting Complexity of a Simple Scheduling Problem”, Operations Research Letters 37, 365-367, 2009.
  187. Bordenave, C., Gendreau, M., Laporte, G., “A Branch-and-Cut Algorithm for the Non-Preemptive Swapping Problem”, Naval Research Logistics 56, 478-486, 2009.
  188. Berbeglia, G., Hahn, G., “Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete”, Discrete Applied Mathematics 157, 2541-2547, 2009.
  189. Laporte, G., Mesa, J.A., Ortega, F.A., Pozo, M.A., “Locating a Metro Line in a Historical City Centre: Application to Sevilla”, Journal of the Operational Research Society 60, 1462-1466, 2009.
  190. Louveaux, F.V., Laporte, G., “Stochastic Vehicle Routing Problems”, Encyclopedia of Optimization, Springer, Boston, 3829-3832, 2009.
  191. Asef-Vaziri, A., Laporte, G., “Integration of Operational Policies into the Design Phase of a Material Handling Network”, International Journal of Advanced Operations Management 1, 108-134, 2009.
  192. Hien, N., Laporte, G., Roy, J., “Business Environment Factors, Incoterms Selection and Export Performance”, Operations and Supply Chain Management 2, 63-78, 2009.
  193. Hvattum, L.M., Løkketangen, A., Laporte, G., “Scenario Tree Based Heuristics for Stochastic Inventory Routing Problems”, INFORMS Journal on Computing 21, 268-285, 2009.
  194. Smith, H.K., Laporte, G., Harper, P.R., “Locational Analysis: Highlights of Growth to Maturity”, Journal of the Operational Research Society 60 supplement 1, S140-S148, 2009.
  195. Laporte, G., Louveaux, F.V., Semet, F., Thirion, A., “Applications of the Double Standard Model for Ambulance Location”, Innovations in Distribution Logistics, L. Bertazzi, M.G. Speranza and J.A.E.E. van Nunen (eds), Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 235-249.
  196. Paquette, J., Cordeau, J.-F., Laporte, G., “Quality of Service in Dial-a-ride Operations”, Computers & Industrial Engineering 56, 1721-1734, 2009.
  197. Duchenne, É., Laporte, G., Semet, F., “Heuristiques pour le problème du vendeur m-péripatétique”, RAIRO (recherche opérationnelle) 43, 13-26, 2009.
  198. 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.
  199. 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.
  200. 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.
  201. Touhami, S., Bourjolly, J.-M., Laporte, G., “Partial Integration of Frequency Allocation within Antenna Positioning in GSM Mobile Networks”, European Journal of Operational Research 193, 541-551, 2009.
  202. Cornillier, F., Laporte, G., Boctor, F.F., Renaud, J., “The Petrol Station Replenishment Problem with Time Windows”, Computers & Operations Research 36, 919-935, 2009.
  203. Öncan, T., Altinel, I.K., Laporte, G., “A Comparative Analysis of Several Asymmetric Traveling Salesman Problem Formulations”, Computers & Operations Research 36, 637-654, 2009.
  204. Albareda Sambola, M., Fernández, E., Laporte, G., “The Capacity and Distance Constrained Plant Location Problem”, Computers & Operations Research 36, 597-611, 2009.
  205. Hoff, A., Gribkovskaia, I., Laporte, G., Løkketangen, A., “Lasso Solution Strategies for the Vehicle Routing Problem with Pickups and Deliveries”, European Journal of Operational Research 192, 755-766, 2009.
  206. Ghiani, G., Laporte, G., Manni, E., Musmanno, R., “Waiting Strategies for the Dynamic and Stochastic Traveling Salesman Problem”, International Journal of Operations Research 5, 233-241, 2008.
  207. Laporte, G., “Operational Research: Milestones and Highlights of Canadian Contributions”, INFOR 46, 309-312, 2008.
  208. Pureza, V., Laporte, G., “Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows”, INFOR 46, 165-175, 2008.
  209. 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.
  210. Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., Zaccour, G., “Horizontal Cooperation among Freight Carriers: Request Allocation and Profit Sharing”, Journal of the Operational Research Society 59, 1483-1491, 2008.
  211. Cabral, E.A., Erkut, E., Laporte, G., Patterson, R.A., “Wide Area Telecommunication Network Design: Application to the Alberta SuperNet”, Journal of the Operational Research Society 59, 1460-1470, 2008.
  212. Gribkovskaia, I., Laporte, G., Shlopak, A., “A Tabu Search Heuristic for a Routing Problem Arising in the Servicing of Offshore Oil and Gas Platforms”, Journal of the Operational Research Society 59, 1449-1459, 2008.
  213. Gribkovskaia, I., Laporte, G., “One-to-Many-to-One Single Vehicle Pickup and Delivery Problems”, Vehicle Routing: Latest Advances and Challenges, B. L. Golden, S. Raghavan and E. A. Wasil (eds), Kluwer, Boston, 359-377, 2008.
  214. 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.
  215. Cordeau, J.-F., Laporte, G., Pasin, F., “Iterated Tabu Search for the Car Sequencing Problem”, European Journal of Operational Research 191, 945-956, 2008.
  216. 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.
  217. 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.
  218. Cornillier, F., Boctor, F. F., Laporte, G., Renaud, J., “A Heuristic for the Multi-Period Petrol Station Replenishment Problem”, European Journal of Operational Research 191, 295-305, 2008.
  219. Bolduc, M.-C., Renaud, J., Boctor, F.F., Laporte, G., “A Perturbation Metaheuristic for the Vehicle Routing Problem with Private Fleet and Common Carriers”, Journal of the Operational Research Society 59, 776-787, 2008.
  220. 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.
  221. Cornillier, F., Boctor, F.F., Laporte, G., Renaud, J., “An Exact Algorithm for the Petrol Station Replenishment Problem”, Journal of the Operational Research Society 59, 607-615, 2008.
  222. 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.
  223. Zanjirani Farahani, R., Laporte, G., Miandoabchi, E., Bina, S., “Designing Efficient Methods for the Tandem AGV Network Design Problem Using Tabu Search and a Genetic Algorithm”, International Journal of Advanced Manufacturing Technology 36, 996-1009, 2008.
  224. Brimberg, J., Hansen, P., Laporte, G., Mladenović, N., Urosević, D., “The Maximum Return-on-Investment Plant Location Problem”, Journal of the Operational Research Society 59, 399-406, 2008.
  225. Geismar, H.N., Laporte, G., Lei, L., Sriskandarajah, C., “The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan”, INFORMS Journal on Computing 20, 21-33, 2008.
  226. Gribkovskaia, I., Laporte, G., Shyshou, A., “The Single Vehicle Routing Problem with Deliveries and Selective Pickups”, Computers & Operations Research 35, 2908-2924, 2008.
  227. Gendreau, M., Iori, M., Laporte, G., Martello, S., “A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints”, Networks 51, 4-18, 2008.
  228. 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.
  229. 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.
  230. Gingras, C., Cordeau, J.-F., Laporte, G., “Un algorithme de minimisation du transport à vide appliqué à l’industrie forestière”, INFOR 45, 41-47, 2007.
  231. Laporte, G., “What You Should Know about the Vehicle Routing Problem”, Naval Research Logistics 54, 811-819, 2007.
  232. 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.
  233. Duchenne, É., Laporte, G., Semet, F., “The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms”, Operations Research 55, 949-965, 2007.
  234. 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.
  235. Breton, M., Dupuis, D.J., Laporte, G., “Cent ans d’histoire en méthodes quantitatives”, Gestion 32 (3), 12-20, 2007.
  236. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M. G., “A Branch-and-Cut Algorithm for a Vendor Managed Inventory Routing Problem”, Transportation Science 41, 382-391, 2007.
  237. Laporte, G., Marín, Á., Mesa, J.A., Ortega, F.A., “An Integrated Methodology for the Rapid Transit Network Design Problem”, Lecture Notes in Computer Science, Springer, Berlin, 4359, 187-199, 2007.
  238. Chiarandini, I. Dumitrescu, T. Stuetzle, “Stochastic Local Search Algorithms for the Graph Coloring Problem”, Handbook of Approximation Algorithms and Metaheuristics, T.F. Gonzales (ed.), Chapman & Hall/CRC, Chapter 63, 2007.
  239. Cordeau, J.-F., Laporte, G., “The Dial-a-Ride Problem: Models and Algorithms”, Annals of Operations Research 153, 29-46, 2007.
  240. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., “Static Pickup and Delivery Problems: A Classification Scheme and Survey”, TOP 15, 1-31, 2007 (discussions: 32-44; rejoinder: 45-47).
  241. Laporte, G., Rodríguez Martín, I., “Locating a Cycle in a Transportation or a Telecommunications Network”, Networks 50, 92-108, 2007.
  242. Hvattum, L.M., Løkketangen, A., Laporte, G., “A Branch-and-Regret Heuristic for Stochastic and Dynamic Vehicle Routing Problems”, Networks 49, 330-340, 2007.
  243. 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.
  244. Haugland, D., Ho, S.C., Laporte, G., “Designing delivery districts for the vehicle routing problem with stochastic demands”, European Journal of Operational Research 180, 997-1010, 2007.
  245. Pisinger, D., Ropke, S., “A General Heuristic for Vehicle Routing Problems”, Computers & Operations Research 34, 2403-2435, 2007.
  246. Cabral, E. A., Erkut, E., Laporte, G., Patterson, R. A., “The Network Design Problem with Relays”, European Journal of Operational Research 180, 834-844, 2007.
  247. Gribkovskaia, I., Halskau, Ø., Laporte, G., “The Bridges of Königsberg – A Historical Perspective”, Networks 49, 199-203, 2007.
  248. 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.
  249. 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.
  250. Babin, G., Deneault, S., Laporte, G., “Improvements to the Or-opt Heuristic for the Symmetric Traveling Salesman Problem”, Journal of the Operational Research Society 58, 402-407, 2007.
  251. Gribkovskaia, I., Halskau, Ø., Laporte, G., Vlcek, M., “General Solutions to the Single Vehicle Routing Problem with Pickups and Deliveries”, European Journal of Operational Research 180, 568-584, 2007.
  252. Albareda-Sambola, M., Fernández, E., Laporte, G., “Heuristic and Lower bound for a Stochastic Location Routing Problem”, European Journal of Operational Research 179, 940-955, 2007.
  253. 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.
  254. 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.
  255. 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.
  256. Asef-Vaziri, A., Laporte, G., Ortiz, R.A., “Exact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem”, European Journal of Operational Research 176, 707-726, 2007.
  257. Laporte, G., Zanjirani Farahani, R., Miandoabchi, E., “Designing an Efficient Method for Tandem AGV Network Design Problem Using Tabu Search”, Applied Mathematics and Computation 183, 1410-1421, 2006.
  258. Hien, N., Laporte, G., Roy, J., “Sélection et utilisation des Incoterms dans les entreprises exportatrices québécoises”, Logistique & Management 14, 85-96, 2006.
  259. 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.
  260. Ropke, S., Pisinger, D., “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows”, Transportation Science 40, 455-472, 2006.
  261. Hvattum, L.M., Løkketangen, A., Laporte, G., “Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic”, Transportation Science 40, 421-438, 2006
  262. Mitrović-Minić, S., Laporte, G., “The Pickup and Delivery Problem with Time Windows and Transshipment”, INFOR 44, 217-227, 2006.
  263. Privé, J., Renaud, J., Boctor, F.F., Laporte, G., “Solving a Vehicle Routing Problem Arising in Soft Drink Distribution”, Journal of the Operational Research Society 57, 1045-1052, 2006
  264. Gendreau, M., Iori, M., Laporte, G., Martello, S., “A Tabu Search Algorithm for a Routing and Container Loading Problem”, Transportation Science 40, 342-350, 2006.
  265. Cordeau, J.-F., Laporte, G., “Modeling and Optimization of Vehicle Routing and Arc Routing Problems”, Handbook on Modelling for Discrete Optimization, G. Appa, L. Pitsoulis and H.P. Williams, eds., Springer, New York, 151-191, 2006.
  266. Touhami, S., Bourjolly, J.-M., Laporte, G., “Antenna Positioning in Mobile Telecommunication Networks”, INFOR 44, 157-174, 2006.
  267. Costa, A.M., Cordeau, J.-F., Laporte, G., “Steiner Tree Problems with Profits”, INFOR 44, 99-115, 2006.
  268. Ghiani, G., Laporte, G., Semet, F., “The Black and White Traveling Salesman Problem”, Operations Research 54, 366-378, 2006.
  269. Bektas, T., Oguz, O. and Ouveysi, I., “A Novel Optimization Algorithm for Video Placement and Routing”, IEEE Communications Letters 10, 114-116, 2006.
  270. Ropke, S., Pisinger, D., “A Unified Heuristic for a Large Class of Vehicle Routing Problems with Backhauls”, European Journal of Operational Research 171, 750-775, 2006.
  271. Gendreau, M., Laporte, G., Semet, F., “The Maximal Expected Coverage Relocation Problem for Emergency Vehicles”, Journal of the Operational Research Society, 57, 22-28, 2006.
  272. Moccia, L, Cordeau, J.-F., 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, 2006.
  273. Boland, N., Dethridge, J., Dumitrescu, I., “The Elementary Resource Constrained Shortest Path Problem”, Operations Research Letters 34, 58-68, 2006.
  274. Cordeau, J.-F., Laporte, G., Legato, P., Moccia, L., “Models and Tabu Search Heuristics for the Berth-Allocation Problem”, Transportation Science 39, 526-538, 2005.
  275. Arriola, R., Laporte, G., Ortega, F. A., “The Weber Problem in a Multi-Storey Building”, INFOR 43, 157-169, 2005.
  276. Cordeau, J.-F., Laporte, G., “Maximizing the Value of an Earth Observation Satellite Orbit”, Journal of the Operational Research Society 56, 962-968, 2005.
  277. Laporte, G., “Comments on ‘Towards a Unified Territorial Design Approach: Applications, Algorithms and GIS Integration’, by Kalcics, Nickel and Schröder”, TOP 13, 62-64, 2005.
  278. Beraldi, P., Ghiani, G., Laporte, G., Musmanno, R., “Efficient Neighbourhood Search for the Probabilistic Pickup and Delivery Travelling Salesman Problem”, Networks 46, 195-198, 2005.
  279. Zanjirani Farahani, R., Laporte, G., Sharifyazdi, M., “A Practical Algorithm for the Shortest Loop Design Problem in a Block Layout”, International Journal of Production Research 43, 1879-1887, 2005.
  280. Dasci, A., Laporte, G., “A Continuous Model for Multi-Store Competitive Location”, Operations Research 53, 263-280, 2005.
  281. Laporte, G., Mesa, J.A., Ortega, F.A., Sevillano, I., “Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment”, Annals of Operations Research 136, 49-63, 2005.
  282. Dasci, A., Verter, V., “Evaluation of Plant Focus Strategies: A Continuous Approximation Framework”, Annals of Operations Research 136, 303-327, 2005.
  283. Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.-S., “New Heuristics for the Vehicle Routing Problem”. In A. Langevin and D. Riopel, eds., Logistics Systems: Design and Optimization, Springer, New York, 279-297, 2005.
  284. Dasci, A., Laporte, G., “An Analytical Approach to the Facility Location and Capacity Acquisition Problem under Demand Uncertainty”, Journal of the Operational Research Society 56, 397-405, 2005.
  285. Asef-Vaziri, A., Laporte, G., “Loop Based Facility Planning and Material Handling”, European Journal of Operational Research 164, 1-11, 2005.
  286. Duchenne, E., Laporte, G., Semet, F., “Branch-and-Cut Algorithms for the Undirected m-Peripatetic Salesman Problem”, European Journal of Operational Research 162, 700-712, 2005.
  287. Costa, A., “A Survey of Benders Decomposition Applied to Fixed Charge Network Design Problems”, Computers & Operations Research 32, 1429-1450, 2005.
  288. Mercier, A., Cordeau, J.-F., Soumis, F., “A Computational Study of Benders Decomposition for the Integrated Aircraft Routing and Crew Scheduling Problem”, Computers & Operations Research 32, 1451-1476, 2005.
  289. Albareda-Sambola, M., Díaz, J.A., Fernández, E., “A Compact Model and Tight Bounds for a Combined Location/Routing Problem”, Computers & Operations Research 32, 407-428, 2005.
  290. Labbé, M., Laporte, G., Rodríguez-Martín, I., Salazar Gonzalez, J.J., “Locating Median Cycles in Networks”, European Journal of Operational Research 160, 457-470, 2005.
  291. Cordeau, J.-F., Laporte, G., “Tabu Search Heuristics for the Vehicle Routing Problem”, in Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee (eds.), Kluwer, Boston, pp. 145-163, 2005.
  292. Lessing, L, Dumitrescu, I., Stützle, T., “A Comparison between ACO Algorithms for the Set Covering Problem”, Lecture Notes in Computer Science 3172, 1-12, 2004.
  293. Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R., “Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions”, Journal of Mathematical Modelling and Algorithms 3, 209-223, 2004.
  294. Laporte, G. Mesa, J.A., Ortega, F.A., “Generación de Alineamentos no Zigzagueantes de Máxima Cobertura de Viaje en el Diseño de Sistema Urbanos de Transporte”, Proceedings of the Sixth Congress of Transport Engineering, University of Zaragoza, Spain 703-710, 2004.
  295. Dasci, A., Laporte, G., “Location and Pricing Decisions of a Multi-Store Monopoly in a Spatial Market”, Journal of Regional Science 44, 489-515, 2004.
  296. Kara, I., Laporte, G., Bektas, T., “A Note on the Lifted Miller-Tucker-Zemlin Subtour Elimination Constraints for the Capacited Vehicle Routing Problem”, European Journal of Operational Research 158, 793-795, 2004.
  297. Mitrović-Minić, S., Krishnamurti, R., Laporte, G., “Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows”, Transportation Research B 38, 669-685, 2004.
  298. Mitrović-Minić, S., Laporte, G.,”Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Windows”, Transportation Research B 38, 635-655, 2004.
  299. Labbé, M., Laporte, G., Rodríguez Martín, I., Salazar González, J.J. “The Ring Star Problem: Polyhedral Analysis and Exact Algorithm”, Networks 43, 177-189, 2004.
  300. Agarwal, R., Ahuja, R.K., Laporte, G., Shen, Z.-J., “A Composite Very Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem”, Handbook of Scheduling: Algorithms, Models and Performance Analysis, J. Leung, ed., Chapman & Hall/CRC, Boca Raton, FL, pp. 49.1-49.23, 2004.
  301. Laporte, G., “Book Review: Randolph W. Hall (editor), Handbook of Transportation Science, Second Edition, International Series in Operations Research and Management Science 56, Kluwer, Dordrecht, 2003”, Operations Research Letters 32, 394-397, 2004.
  302. Attanasio, A., Cordeau, J.-F., Ghiani, G., Laporte, G., “Parallel Tabu Search Heuristics for the Dynamic Multi-Vehicle Dial-a-Ride Problem”, Parallel Computing, 30, 377-387, 2004.
  303. Cordeau, J.-F., 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, 2004.
  304. Feremans, C., Labbé, M., Laporte, G., “The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm”, Networks, 43, 71-86, 2004.
  305. Renaud, J., Boctor, F.F., Laporte, G., “Efficient Heuristics for Median Cycle Problems”, Journal of the Operational Research Society, 55, 179-186, 2004.
  306. Cabral, E.A., Gendreau, M., Ghiani, G., Laporte, G., “Solving the Hierarchical Postman Problem as a Rural Postman Problem”, European Journal of Operational Research 155, 44-50, 2004.
  307. Gendreau, M., Laporte, G., Semet, F.J., “Heuristics and Lower Bounds for the Bin Packing Problem with Conflicts”, Computers & Operations Research, 31, 347-358, 2004.
  308. Laporte, G., Riera-Ledesma, J., Salazar-González, J.-J., “A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem”, Operations Research 51, 940-951, 2003.
  309. Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F., “Métaheuristiques pour le problème de tournées de véhicules”, Résolution de problèmes de RO par les métaheuristiques, M. Pirlot et J. Teghem, eds., Lavoisier, pp. 47-70, 2003.
  310. Blais, M., Lapierre, S.D., Laporte, G., “Solving a Home-Care Districting Problem in an Urban Setting”, Journal of the Operational Research Society, 54, 1141-1147, 2003.
  311. Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R., “Real-Time Vehicle Routing: Algorithms and Parallel Computing Strategies”, European Journal of Operational Research, 151, 1-11, 2003.
  312. Cordeau, J.-F., Laporte, G., “The Dial-a-Ride Problem (DARP): Variants, Modeling Issues and Algorithms”, 4OR – Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1, 89-101, 2003.
  313. Blais, M., Laporte, G., “Exact Solution of the Generalized Routing Problem through Graph Transformations”, Journal of the Operational Research Society, 54, 906-910, 2003.
  314. Labbé, M., Laporte, G., Martello, S., “Upper Bounds and Algorithms for the Maximum Cardinality Bin Packing Problem”, European Journal of Operational Research, 149, 490-498, 2003.
  315. Cordeau, J.-F., Laporte, G., “A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem”, Transportation Research B, 37, 579-594, 2003.
  316. Brotcorne, L., Laporte, G., Semet, F. “Ambulance Location and Relocation Models”, European Journal of Operational Research, 148, 451-463, 2003.
  317. Feremans, C., Labbé, M., Laporte, G., “Generalized Network Design Problems”, European Journal of Operational Research, 148, 1-13, 2003.
  318. Boctor, F.F., Laporte, G., Renaud, J., “Heuristics for the Traveling Purchaser Problem”, Computers & Operations Research, 30, 491-504, 2003.
  319. Bourgeois, M., Laporte, G., Semet, F., “Heuristics for the Black and White Traveling Salesman Problem”, Computers & Operations Research, 30, 75-85, 2003.
  320. Bozkaya, B., Erkut, E., Laporte, G., “A Tabu Search Heuristic and Adaptive Memory Procedure for Political Districting”, European Journal of Operational Research, 144, 12-26, 2003.
  321. Laporte, G., Louveaux, F.V., Van hamme, L. “An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands”, Operations Research, 50, 415-423, 2002.
  322. Lingaya, N., Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Soumis, F., “Operational Car Assignment at VIA Rail Canada”, Transportation Research B, 36, 755-778, 2002.
  323. Dasci, A., Eiselt, H.A., Laporte, G., “On the (r|Xp)-Medianoid Problem on a Network with Vertex and Edge Demands”, Annals of Operations Research, 111, 269-276, 2002.
  324. Bruno, G., Laporte, G., “An Interactive Decision Support System for the Design of Rapid Public Transit Networks”, INFOR, 40, 111-118, 2002.
  325. Laporte, G., Palekar, U., “Some Applications of the Clustered Travelling Salesman Problem”, Journal of the Operational Research Society, 53, 972-976, 2002.
  326. Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F., “A Guide to Vehicle Routing Heuristics”, Journal of the Operational Research Society, 53, 512-522, 2002.
  327. Bruno, G., Laporte, G., “A Simple Enhancement of the Esau-Williams Heuristic for the Capacitated Minimum Spanning Tree Problem”, Journal of the Operational Research Society, 53, 583-586, 2002.
  328. Ghiani, G., Hertz, A., Laporte, G., “Recent Algorithmic Advances for Arc Routing Problems”, Operations Research/Management Science at Work, E. Kozan and A. Ohuchi, eds., pp. 1-20, Kluwer, Boston, 2002.
  329. Feremans, C., Labbé, M., Laporte, G., “A Comparative Analysis of Several Formulations for the Generalized Minimum Spanning Tree Problem”, Networks, 39, 29-34, 2002.
  330. Renaud, J., Boctor, F.F., Laporte, G., “Perturbation Heuristics for the Pickup and Delivery Traveling Salesman Problem”, Computers & Operations Research, 29, 1129-1141, 2002.
  331. Brotcorne, L., Laporte, G., Semet, F. “Fast Heuristics for Large Scale Covering-Location Problems, Computers & Operations Research 29, 651-665, 2002.
  332. Laporte, G., Mesa, J.A., Ortega, F.A., “Locating Stations on Rapid Transit Lines”, Computers & Operations Research, 29, 741-759, 2002.
  333. Cordeau, J.-F., Desrosiers, J., Soumis, F., Stojkovic, G., “Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling”, Transportation Science, 35, 375-388, 2002.
  334. Laporte, G. Semet, F., “Classical Heuristics for the Capacitated VRP”, The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, pp. 109-128, 2002.
  335. Gendreau, M., Laporte, G., Potvin, J.-Y., “Metaheuristics for the Capacitated VRP”, The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, pp. 129-154, 2002.
  336. Cordeau, J.-F., Desaulniers, G., Desrosiers, J, Solomon, M.M., Soumis, F., “The VRP with Time Windows”, The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications, pp. 157-193, 2002.
  337. Bruno, G., Gendreau, M., Laporte, G., “A Heuristic for the Location of a Rapid Transit Line”, Computers & Operations Research, 29, 1-12, 2002.
  338. Gendreau, M., Laporte, G., Semet, F., “A Dynamic Model and Parallel Tabu Search Heuristic for Real-Time Ambulance Relocation”, Parallel Computing, 27, 1641-1653, 2001.
  339. Feremans, C., Labbé, M., Laporte, G., “On Generalized Minimum Spanning Trees”, European Journal of Operational Research, 134, 457-458, 2001.
  340. Clossey, J., Laporte, G., Soriano, P. “Solving Arc Routing Problems with Turn Penalties”, Journal of the Operational Research Society, 52, 463-469, 2001.
  341. Cordeau, J.-F., 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, 2001.
  342. Cordeau, J.-F., Laporte, G., “A Tabu Search Heuristic for the Site Dependent Vehicle Routing Problem with Time Windows”, INFOR, 39, 292-298, 2001.
  343. Ghiani, G., Improta, G., Laporte, G., “The Capacitated Arc Routing Problem with Intermediate Facilities”, Networks, 37, 134-143, 2001.
  344. Ghiani, G, Laporte, G., “Location-Arc Routing Problems”, Opsearch, 38, 151-159, 2001.
  345. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Lingaya, N., Soumis, F., “Simultaneous Locomotive and Car Assignment at VIA Rail Canada”, Transportation Research Part B: Methodological, 35, 767-787, 2001.
  346. Cordeau, J.-F., Desrosiers, J., Soumis, F., “Simultaneous Assignment of Locomotives and Cars to Passenger Trains”, Operations Research, 49, 531-548, 2001.
  347. Laporte, G., Mesa, J.A., Ortega, F.A, “Localización de Intercambiadores sobre un Anillo de Transporte Rápido”, Calidad e Innovación en Los Transportes, Vol. 1, J. Colomer and A. Garcia, eds., Valencia, 129-137, 2001.

Forthcoming papers

  1. Flores-Garza, D.A., Salazar-Aguilar, M.A., Ngueveu, S.U., Laporte, G., “The Multi-Vehicle Cumulative Covering Tour Problem”, Annals of Operations Research.
  2. Pelletier, S., Jabali, O., Laporte, G., Veneroni, M., “Battery Degradation and Behavior Modeling for Electric Vehicles”, Transportation Research Part B.
  3. Dufour, É., Laporte, G., Paquette, J., Rancourt, M.-È., “Logistics Service Network Design for Humanitarian Response in East Africa”, Omega.
  4. De Los Santos, A., Laporte, G., Mesa, J.A., Perea, F., “The Railway Line Frequency and Size Setting Problem”, Public Transport.
  5. Canca, D., De Los Santos, A., Laporte G., Mesa J.A., “An Adaptive Neighborhood Search Metaheuristic for the Network Design, Line Planning and Capacity Problem in Presence of a Competing Transportation Mode”, Advanced Concepts, Methodologies and Technologies for Transportation and Logistics, J. Żak, Y. Hadas and R. Rossi (Eds.) Springer.
  6. Koç, Ç., Jabali, O., Laporte, G., “Long-Haul Vehicle Routing and Scheduling with Idling Options”, Journal of the Operational Research Society.
  7. Ortiz-Astorquiza, C., Contreras, I., Laporte, G., “Formulations and Approximation Algorithms for Multi-Level Uncapacitated Facility Location”, INFORMS Journal on Computing.
  8. Moccia, L., Giallombardo, G., Laporte, G., “Models for Technology Choice in a Transit Corridor with Elastic Demand”, Transportation Research Part B.
  9. Corberán, Á., Erdogan, G., Laporte, G., Plana, I., Sanchis, J.M., “The Chinese Postman Problem with Load-Dependent Costs”, Transportation Science.
  10. Fernández, E., Laporte, Rodríguez-Pereira, J., “A Branch-and-Cut Algorithm for the Multi-Depot Rural Postman Problem”, Transportation Science.
  11. Paraskevopoulos, D.C., Laporte, G., Repoussis, P.P., Tarantilis, C.D., “Resource Constrained Routing and Scheduling: Review and Research Prospects”, European Journal of Operational Research.
  12. Wøhlk, S., Laporte, G., “Computational Comparison of Several Greedy Algorithms for the Minimum Cost Perfect Matching Problem on Large Graphs”, Computers & Operations Research.

 Submitted papers

  1. Franceschetti, A., Jabali, O., Laporte, G., “Continuous Approximation Models in Freight Distribution Management”, TOP, April 2017.
  2. Koç, Ç., Mendoza, J.E., Jabali, O., Laporte, G., “The Electric Vehicle Routing Problem with Shared Charging Stations”, European Journal of Operational Research, May 2017.
  3. Belhaiza, S., M’Hallah, R., Ben Brahim, G., Laporte, G., “A Multi-Start Evelutionary Heuristic for the Vehicle Routing Problem with Multiple Time Windows”, Computers & Operations Research, May 2017.
  4. Wøhlk, S., Laporte, G., “A Fast Heuristic for Very Large-Scale Capacitated Arc Routing Problems”, Journal of the Operational Research Society, May 2017.
  5. Koç, C., Laporte, G., “Vehicle Routing with Backhauls: Review and Research Perspectives”, Computers & Operations Research, March 2017.
  6. Mladenović, M., Delot, T., Laporte, G., Wilbaut, C., “A GPS-Based Parking Allocation Problem”, International Transactions in Operational Research, March 2017.
  7. Schiffer, M., Schneider, M., Laporte, G., “Designing Sustainable Mid-Haul Logistics Networks with Intra-Route Multi-Resource Facilities”, European Journal of Operational Research, March 2017.
  8. Ortiz-Astorquiza, C., Contreras, I., Laporte, G., “An Exact Algorithm for Multi-Level Uncapacitated Facility Location”, Transportation Science, March 2017.
  9. Ortiz-Astorquiza, C., Contreras, I., Laporte, G., “Multi-Facility Location Problems”, European Journal of Operational Research, March 2017.
  10. Kisialiou, Y., Gribkovskaia, I., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for the Periodic Supply Vessel Planning Problem with Flexible Departures and Coupled Vessels”, Computers & Operations Research, January 2017.
  11. Nesello, V., Subramanian, A., Battarra, M., Laporte, G., “Exact Solution of the Single-Machine Scheduling Problem with Periodic Maintenances and Sequence-Dependent Setup Times”, European Journal of Operational Research, December 2016.
  12. Gutiérrez-Jarpa, G., Laporte, G., Marianov, V., “Corridor-Based Metro Network Design with Travel Flow Capture”, Computers & Operations Research, December 2016.
  13. Nasri, M.I., Bektas, T., Laporte, G., “The Pollution Routing Problem with Stochastic Speed Limits”, Transportation Science, March 2017.
  14. Franceschetti, A., Honhon, D., Laporte, G., Van Woensel, T., “A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem”, Transportation Science, November 2016.
  15. Palomo-Martínez, P.J., Salazar-Aguilar, M., Laporte, G., «Planning a Selective Delivery Schedule through Adaptive Large Neighborhood Search», Industrial Engineering, February 2017.
  16. Wang, K., Zhen, L., Wang, S., Laporte, G., “Column Generation for the Integrated Berth Allocation, Quay Crane Assignment and Yard Assignment Problem”, Transportation Science, September 2016.
  17. Bulhões, T., Subramanian, A., Erdogan, G., Laporte, G., “The Static Bike Relocation Problem with Multiple Vehicles and Visits”, European Journal of Operational Research, août 2016.

Prizes and mentions

  1. According to a recent study (Laengle, S., Merigó, J.M., Miranda, J., Slowinski, R., Bomze, I., Borgonovo, E., Dyson, R.G., Oliveira, J.F., Teunter, R., “Forty Years of the European Journal of Operational Research”, 262, 803-816, 2017), Gilbert Laporte is the most productive and influential author in the European Journal of Operational Research.
  2. Doctoral Award, Operational Research Society, Çagri Koç, April 2017.
  3. Prix d’excellence FRQNT 2016-2017, Gilbert Laporte, 2017.
  4. According to a recent study (Merigó, J.M., Yang, J.-B., “A Bibliometric Analysis of Operations Research and Management Science”, Omega, December 2016, forthcoming), Gilbert Laporte is the most productive and influential author in OR-MS worldwide.
  5. Acfas Urgel-Archambault Prize in physical sciences, mathematics, computer science or engineering, Gilbert Laporte 2016.
  6. Practice Prize, Canadian Operational Research Society, “Logistics service network design for humanitarian response in East Africa”, É. Dufour, G. Laporte, J. Paquette, M.-È. Rancourt, 2016.
  7. Doctorate Honoris Causa, Eindhoven University of Technology, the Netherlands, Gilbert Laporte, 2016.
  8. Best Reviewer Award, European Journal of Operational Research, Gilbert Laporte, 2016.
  9. Best Ph.D. Thesis, GERAD, Marilène Cherkesly, 2016.
  10. Professor Gilbert Laporte is ranked 947th among the world’s 1,040 most widely cited authors, based on his h index and his Google Scholar Citations public profile. His h index is 102, for 39,171 citations.
  11. Operational Research Society Doctoral Award (United Kingdom), Çagri Koç, 2015
  12.  Outstanding Reviewer, Discrete Optimization, Gilbert Laporte, 2015.
  13. Second Best Presentation at the TORS’15 Conference, Sousse, Tunisia, June 2015: Lahyani, R., Coelho, L.C., Khemakem, M., Laporte, G., Semet, F., “A Multi-Compartment Vehicle Routing Problem Arising in the Colleciton of Olive Oil in Tunisia”.
  14. Lifetime Achievement Award in Location Analysis, Section on Location Analysis, INFORMS, Gilbert Laporte, 2014.
  15. Winner of FICO’s Global “Optimize the Real World” contest, Roel G. van Anholt, Leandro C. Coelho, Gilbert Laporte and Iris F.A. Vis, 2014.
  16. Certificate of Excellence in Reviewing, European Journal of Operational Research, Gilbert Laporte, 2014.
  17. Certificate of Excellence in Reviewing, Computers & Operations Research, Gilbert Laporte, 2013.
  18. Meritorious Service Award, INFORMS, G. Laporte, 2013.
  19. Prix Esdras-Minville pour l’article “The Exact Solution of Several Classes of Inventory-Routing Problems”, Leandro C. Coelho, 2013.
  20. Best Paper Award Runner-up, Production and Operations Management Scoiety, College of Humanitarian & Crisis Management, “Tactical Network Planning for Food Aid Distribution in Kenya”, Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte, Ben Watkins, 2013.
  21. Prix Pierre-Laurin pour l’ensemble des réalisations de recherche au cours de la carrière, HEC Montréal, G. Laporte, 2012.
  22. Best Reviewer Award, European Journal of Operational Research, G. Laporte, 2012.
  23. Gilbert Laporte is Canada’s third most influential researcher in the field of business, according to HiBAR, the Hirsch-Index Benchmarking of Academic Research, 2012.
  24. Prix Esdras-Minville, HEC Montréal, pour l’article “The Inventory-Routing Problem with Transshipment”, Leandro C. Coelho, 2012.
  25. Prix Esdras-Minville, HEC Montréal, pour l’article “Long-Haul Vehicle Routing and Scheduling with Working Hour Rules”, Marie-Ève Rancourt, 2012.
  26. Jim Davey Award, Canadian Transportation Research Forum , best doctoral paper, Julie Paquette (Advisors: J.-F. Cordeau, G. Laporte), 2011.
  27. Prix Mercure, HEC Montréal, Meilleure thèse de doctorat, “Complexity Analyses and Algorithms for Pickup and Delivery Problems”, G. Berbeglia (Advisors: J.-F. Cordeau, G. Laporte), 2011.
  28. Best Reviewer Award, European Journal of Operational Research, G. Laporte, 2010.
  29. Prix Sofía Kovalévskaia, Angélica Salazar-Aguilar, 2010.
  30. Prix Pierre-Laurin, HEC Montréal, G. Laporte, 2010.
  31. The Network Optimization Workshop 2010 was organized in August 2010, in Ajaccio, France, to mark the 60th anniversary of Gilbert Laporte.
  32. Practice Prize, Canadian Operational Research Society, “Designing New Electoral Districts for the City of Edmonton”, B. Bozkaya, E. Erkut, D. Haight, G. Laporte, 2010.
  33. Cecil Graham Doctoral Dissertation Award, Canadian Applied and Industrial Mathematics Society, “Complexity Analyses and Algorithms for Pickup and Delivery Problems”, G. Berbeglia (Advisors: J.-F. Cordeau, G. Laporte), 2010.
  34. Prix Esdras-Minville, HEC Montréal, pour l’article “Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete”, G. Berbeglia, 2010.
  35. According to a recent study (Hsieh, P.-N., Chang, P.-L, “An Assessment of World-Wide Research Productivity in Production and Operations Management”, International Journal of Production Economics 120, 540-551, 2009), Gilbert Laporte is the most prolific author in five top journals of his field, he has the highest h-index among 44,881 authors surveyed, and he comes third for the number of publications in 20 journals for the period 1959-2008.
  36. Robert Herman Lifetime Achievement Award in Transportation Science, Transportation Science and Logistics Society, INFORMS, G. Laporte, 2009.
  37. 42nd Honorary Member of the INFORMS International Omega Rho Society, G. Laporte, 2009.
  38. Prix Gérard-Parizeau, Fondation Gérard-Parizeau, G. Laporte, 2009.
  39. Premier Prix, Challenge ROADEF 2009, “La gestion des perturbations dans le domaine aérien”, S. Bisaillon, J.-F. Cordeau, G. Laporte, F. Pasin.
  40. Honorable mention, Transportation Science and Logistics Section of INFORMS, for the article “Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic”, L.M. Hvattum, A. Løkketangen, G. Laporte, 2008.
  41. Cecil Graham Doctoral Dissertation Award, Canadian Applied and Industrial Mathematics Society, “Models and algorithms for two network design problems”, A.M. Costa (Advisors: J.-F. Cordeau, G. Laporte), 2008.
  42. Progistix National Student Paper Award, Supply Chain & Logistics Association Canada, T. Chan (Advisors: J.-F. Cordeau, G. Laporte), 2008.
  43. Publication Award 2007, California State University, for the article: Asef-Vaziri, A., Laporte, G., Ortiz, R.A., “Exact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem”, European Journal of Operational Research 176, 707-726, 2007.
  44. Médaille Innis-Gérin, Société royale du Canada, Gilbert Laporte, 2007.
  45. Prix Roger-Charbonneau pour le livre “Transportation”, HEC Montréal, C. Barnhart, G. Laporte, 2007.
  46. Deuxième Prix (ex aequo), Challenge ROADEF 2007, “Planification des Techniciens et des Interventions pour les Télécommunications”, J.-F. Cordeau, G. Laporte, F. Pasin, S. Ropke.
  47. First Prize, A.M.Stevens Award, Canadian Transportation Research Forum, Student Research Paper Competition 2005-2006 (Best Masters Papers), “Transport international: l’importance de la considération de l’environnement dans la sélection des Incoterms et la performance export”, N. Hien (Advisors: G. Laporte, J.Roy), 2007.
  48. Second Prize, A.M.Stevens Award, Canadian Transportation Research Forum, Student Research Paper Competition 2005-2006 (Best Masters Papers), “Optimisation du transport dans l’industrie forestière”, C. Gingras (Advisors: J.-F. Cordeau, G. Laporte), 2007.
  49. Honorable Mention, CORS Student Paper Competition-Open Category, “L’optimisation du transport dans l’industrie forestière”, C. Gingras (Advisors: J.-F. Cordeau, G. Laporte), 2006.
  50. James Eckler National Student Logistics Paper Award, Supply Chain & Logistics Association Canada, N. Hien (Advisors: G. Laporte, J. Roy), 2006.
  51. Honorable Mention, Ph.D. Dissertation Competition for Operations Research in Telecommunications, INFORMS, “Discrete Location Models for Content Distribution”, T. Bektas (Advisor: Osman Oguz), 2006.
  52. Prix Esdras-Minville, HEC Montréal, pour l’article “Steiner Tree Problems with Profits”, A.M. Costa, 2006.
  53. The article “The Vehicle Routing Routing Problem: An Overview of Exact and Approximate Algorithms”, by Gilbert Laporte (European Journal of Operational Research 59, 345-358, 1992) has been selected as one of the 30 most influential articles among 11,458 articles published in EJOR over the past 30 years.
  54. First Place 2005 Dissertation Prize, Transportation Science and Logistics Section of INFORMS, for the thesis “New Optimization Models and Algorithms for the Management of Maritime Container Terminals”, L. Moccia (Advisors: J.-F. Cordeau, G. Laporte, M. Gaudioso), Università della Calabria.
  55. Prix Pierre-Laurin, HEC Montréal, G. Laporte, 2005.
  56. Fellow of the Institute for Operations Research and the Management Sciences, G. Laporte, 2005.
  57. Discrete Applied Mathematics has published a special issue (vol. 145, 2004) containing some of the papers presented at the Fourth Colloquium on Graphs and Optimization (GO-IV) that took place at Loèche-les-Bains, Switzerland, from August 20 to 24, 2000. This event was organized to mark Gilbert Laporte’s 50th birthday.
  58. Glover-Klingman Prize for the best paper published in Networks in 2004, “The Ring Star Problem: Polyhedral Analysis and Exact Algorithm”, M. Labbé, G. Laporte, I. Rodríguez Martin, J.J. Salazar González, 2005.
  59. Tow Lecturer, Henry B. Tippie College of Business, University of Iowa, G. Laporte, 2005.
  60. Operations Research 2004 Meritorious Service Award, G. Laporte.
  61. Best Paper Prize, Transportation Science and Logistics Section of INFORMS, for the article “An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands”, G. Laporte, F.V. Louveaux, L. Van hamme, 2004.
  62. Prix Roger-Charbonneau pour le livre “Introduction to Logistics Systems Planning and Control”, HEC Montréal, G. Ghiani, G. Laporte, R. Musmanno, 2004.
  63. Glover-Klingman Prize for the best paper published in Networks in 2003, “Improved Preprocessing, Labeling and Scaling Algorithms for the Weight-Constrained Shortest Path Problem”, I. Dumitrescu, N. Boland, 2004.
  64. Honorable Mention, CORS Student Paper Prize-Graduate Student Papers, “La localisation de centres de tri de colis chez Postes Canada”, R. Monfet (Advisors: J.-F. Cordeau, G. Laporte), 2004.
  65. Prix de reconnaissance d’une publication scientifique, Direction du programme de Ph.D. en administration, HEC Montréal, “A Survey of Benders Decomposition Applied to Fixed Charge Network Design Problems”, A.M. Costa, 2004.
  66. Honorable Mention, CORS Student Paper Prize-Graduate Student Papers, “Exact Solution of the Centralized Network Design Problem on Directed Graphs”, F. Gzara (Advisors: J. Desrosiers, J.-L. Goffin, G. Laporte), 2003.
  67. Deuxième Prix, Challenge ROADEF 2003, “Optimisation de la mission d’un satellite d’observation de la Terre”, J.-F. Cordeau, G. Laporte, 2003.
  68. Service Award, Institute for Operations Research and the Management Sciences, Gilbert Laporte, 2002.
  69. Prix jeune chercheur, HEC Montréal, J.-F. Cordeau, 2002.
  70. CORS Practice Second Prize, “Solving a Home Care Districting Problem in an Urban Setting”, M. Blais, S.D. Lapierre, G. Laporte, 2002.
  71. Honorable Mention, CORS Student Paper Prize-Graduate Student Papers, “A Compact Model and Tight Bounds for a Combined Location/Routing Problem”, M. Albareda-Sambola, J.A. Diaz, E. Fernandez (Advisors: E. Fernandez, G. Laporte), 2002.
  72. Grand Prix de la Pédagogie, HEC Montréal, G. Laporte, 2001. 

Honours list, M.Sc. program, HEC Montréal

  1. Samuel Pelletier, analytique d’affaires, 2016.
  2. François Sarrazin, logistique, 2008.
  3. Karine Sinclair, logistique, 2007.
  4. Julie Paquette, logistique, 2006.
  5. Nicolas Hien, logistique, 2005.
  6. Marie-Ève Rancourt, modélisation et décision, 2005.
  7. Geneviève Parent, modélisation et décision, 2004.
  8. Vincent Raymond, modélisation et décision, 2004.
  9. Anne-Marie Walach, logistique, 2004.
  10. Rémy Monfet, logistique, 2003.
  11. Anne-Marie Walach, logistique, 2003.
  12. Karine Cousineau-Ouimet, modélisation et décision, 2002.
  13. Guillaume Hamer-Lavoie, logistique, 2002.
  1. FQRNT actualités, Prix d’excellence du FQRNT, Vol. 18, No. 64, 2017, p. 5.
  2. HEC Montréal MAG, Quatre chercheurs remportent le prix de la pratique de la Société canadienne de recherche opérationnelle, automne 2016, Vol. 15, No., 4.
  3. Bulletin du GERAD, Prix, distinctions, rayonnement … et nouvelles, Vol. 13, No. 2, 2016, p. 15.
  4. Améliorer la distribution des biens, p. H9, Le Devoir, 22 octobre 2016.
  5. Électricité Plus, Bourses Trottier en énergie pour 2016, 9 octobre 2016.
  6. Europa Press, La Junta recuperará los servicios de estadística regionales “que fueron suprimodos en la pasada legislatura”, 5 octobre 2016.
  7. HEC Montréal, Deux chercheurs parmi les plus cités au monde, Spring 2016, Vol. 14, No. 2, p. 8.
  8. Bulletin du GERAD, Prix, distinctions, rayonnement … et nouvelles, Vol. 13, No. 1, 2016, p. 16.
  9. HEC Montréal MAG, Renouvellement de la Chaire de recherche du Canada en distributique, november 2015, Fall 2015, Vol. 13, No. 4, p. 4.
  10. ORMS Today, Lifetime Achievement in Location Analysis, February 2015, Vol. 42, No. 1, p. 55.
  11. Bulletin Recherche HEC, Félicitations au professeur Gilbert Laporte pour le renouvellement de sa chaire de recherche du Canada, janvier 2015, Vol. 7, No. 1., p. 1.
  12. HEC Montréal MAG, Distinctions, Automne 2014, Vol. 13, No. 1.
  13. Bulletin du GERAD, Gilbert Laporte, titulaire de la Chaire de recherche du Canada en distributique / Gilbert Laporte, chairholder of the Canada Research Chair in Distribution Management, Vol 11, No 1, Automne 2014, pp. 4-5.
  14. Génial! Fonds de recherche du Québec – Nature et technologies, Édition numéro 45, 18 décembre 2013.
  15. Iranian Journal of Engineering Education, Interview with Scholars, Vol. 15, No. 58, 2013, pp. 137-158.
  16. HEC Montréal MAG, Distinctions et nominations, Vol 11, No. 3, Printemps 2013, p. 10.
  17. Bulletin du GERAD, Prix, distinctions et rayonnement, Vol. 9, No. 2, 2012, p. 15.
  18. Flash Recherche, HEC Montréal, Prix et distinctions octroyés, Vol. 4, No. 1, Automne 2012, p. 6.
  19. HEC Montréal MAG, Distinctions et nominations, Vol. 11, No. 1, Automne 2012, p. 11.
  20. Bulletin du GERAD, Prix, distinctions et rayonnement, Vol. 9, No. 1, 2012, p. 22.
  21. The Glode and Mail, Canada’s Research Stars, page B07, March 27, 2012.
  22. 24 Hours Operations Research, Loading a set of ULDs optimally, Winter 2012.
  23. FlashRecherche, HEC Montréal, Prix et distinctions octroyés, Vol. 3, No. 1, Automne 2011, p. 11.
  24. HEC Montréal MAG, Étudiants et diplômés à l’honneur, Automne 2011, Vol. 10, No. 1, p.11.
  25. Bulletin du GERAD, Prix, distinctions et rayonnement, Vol. 8, No. 1, 2011, p. 24.
  26. The CORS Bulletin, OR@WORK, Designing New Electoral Districts for the City of Edmonton, Vol. 45, No. 1, 2011, pp. 22-24.
  27. HEC Montréal MAG, Distinctions et nominations, Automne 2010, Vol. 9, No. 1, p. 10.
  28. Corse Matin, Les maths en renfort du secteur de la santé, 2 septembre 2010, p. 1.
  29. La Presse, Meilleure thèse du Canada, 31 juillet 2010, page E10.
  30. Les Affaires, Notre réseau de métro sera toujours handicapé, 20 au 26 février 2010, p. 3.
  31. biz, Le métro de Montréal est handicapé, 22 février 2010.
  32. ORMS Today, Robert Herman Lifetime Achievement Award, Volume 37, Number 1, February 2010.
  33. Les Affaires.com, Un professeur de HEC reconnu comme le plus influent, 1er février, 2010.
  34. CNW, Gilbert Laporte, One of the World’s Top Researchers – The HEC Montréal professor is recognized as the most influential, according to a Taiwanese study., February 1st, 2010.
  35. Gestion & Logistique – Le magazine des gens d’affaire et de logistique, La logistique et les transports au cœur d’un forum national sur le management, octobre 2009.
  36. Bulletin du GERAD, Élaboration d’horaires de travail pour les techniciens d’une entreprise de télécommunications, Vol. 6, Nos 1 et 2, 2009, p. 7.
  37. Edmonton Journal, Edmonton unveils proposal for 12 wards, April 15, 2009, p. 1.
  38. Bulletin du GERAD, Nouvelles brèves, Vol. 7, No. 1, 2010, p. 2.
  39. Le Devoir, 14 octobre 2009, Montréal, au Carrefour des transports, pp. B1 et B5.
  40. HEC Montréal MAG, Distinctions, Automne 2009, Vol. 8, No. 1, p. 10.
  41. HEC Montréal MAG, Gilbert Laporte wins the Gérard-Parizeau Award, Printemps 2009, Vol 7, No. 1, p. 8.
  42. Bulletin du GERAD, Un des nôtres est le top mondial!, Vol. 6, Nos 1 et 2, 2009, p. 1.
  43. Diario de Sevilla, Los matemáticos del Metro, 8 décembre 2009, p. 14.
  44. El Mundo Sevilla, El metro que esquiva a la historia, 17 novembre 2009, p. 6
  45. ABC Sevilla, Un método matemático evita quelas líneas de metro danen los monumento, 17 novembre 2009, p. 44.
  46. ABC Sevilla, Arquitectura plantea dos trazados de la Línea 2 del Metro para danar los edificios, 7 juillet 2008, p. 16.
  47. Bulletin du GERAD, Le professeur Gilbert Laporte a été élu Fellow de l’Institute for Operations Research and Management Sciences, Vol. 3, No. 1, 2006, p. 2.
  48. Bulletin du GERAD, Nouvelles brèves, Vol. 5, No. 2, 2008, p. 2.
  49. Bulletin du GERAD, Gilbert Laporte, lauréat de la Médaille Innis-Gérin, Vol. 5, No. 1, 2008, p. 2.
  50. CORS Times, Interview with Gilbert Laporte, Vol. 2, ed. 1, June 14th, 2008, p. 1.
  51. Génial – Bulletin électronique des regroupements stratégiques – Fonds québécois de la recherche sur la nature et les technologies, Les chercheurs du GERAD collectionnent les honneurs, Édition numéro 4, 10 janvier 2008.
  52. Bulletin du GERAD, Prix Roger-Charbonneau, Vol. 4, No. 2, 2007, p. 2.
  53. ROADEF – Société française de Recherche Opérationnelle et Aide à la Décision, Un exposé passionnant de Gilbert Laporte au congrès ROADEF 2006 sur la petite et la grande histoire du problème du voyageur de commerce, 19 mars 2006.
  54. HEC Montréal MAG, Distinctions, Automne 2005, Vol. 4, No. 1, p. 8.
  55. HEC Montréal MAG, Distinctions, Printemps 2005, Vol. 3, No. 2, p. 8.
  56. Bulletin du GERAD, La puissance de l’ordinateur jumelée à la puissance du cerveau humain, Vol. 2, No. 2, novembre 2005, p. 3.
  57. Bulletin du GERAD, Nouvelles brèves, Vol. 2, No. 2, 2005, p. 2.
  58. Bulletin du GERAD, Cinq grands chercheurs en optimisation combinatoire, Vol. 2, No. 2, 2005, p. 9.
  59. Bulletin du GERAD, Des membres du GERAD nommés titulaires de nouvelles chaires de recherche, Vol. 1, No. 1, 2004, p. 2.
  60. HEC Montréal MAG, Gilbert Laporte : A remarkable career in a rapidly evolving discipline, Printemps 2004, Vol. 2, No. 2, pp. 28-29.
  61. The Gazette, The logistics of profit, October 6, 2001, p. K6.
  62. Le Caducée, Création de la chaire de distributique, Vol. 51, No. 1, Automne 2001, p. 12.
  63. HEC Échanges, Lancement de la Chaire de recherche du Canada en distributique, Vol. 18, No.3, 2001, p. 1.
  64. La Presse, Création d’une chaire en distributique, 29 octobre 2001, p. E2.
  65. Chroniques Telbec Plus, L’École des Hautes Études Commerciales a annoncé la création de la chaire de recherche du Canada en distributique, 12 octobre 2001.
  66. Forum, La distributique se fait chaire, Vol. 36, No. 5, 24 septembre 2001, p. 5.
  67. Les Affaires, Nouvelle chaire de distributique, 22 septembre 2001, p. 28.
  68. National Post, Montreal’s HEC creates chair in distribution management, September 12, 2001, p. C1.