Publications

Books

  1. Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.), Location Science (Second Edition), Springer, Cham, 767 pages, 2019. [This edition of the book won a prize.]
  2. Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.), Location Science, Springer, Berlin-Heidelberg, 644 pages, 2015.
  3. Corberán, Á, Laporte, G., (eds.), Arc Routing: Problems, Methods and Applications, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 401 pages, 2014.
  4. Ghiani, G., Laporte, G., Musmanno, R., Introduction to Logistics Systems Management (Second Edition), Wiley, Chichester, 455 pages, 2013.
  5. Ghiani, G., Laporte, G., Musmanno, R., Introduzione alla Gestione dei Sistemi Logistici, Isedi, Torino, 450 pages, 2012.
  6. Barnhart, C., Laporte, G. (eds.), Transportation, Handbooks in Operations Research and Management Science, Volume 14, Elsevier, Amsterdam, 783 pages, 2007. [This book won a prize.]
  7. Eiselt, H. A., Laporte, G., Verter, V. (eds.), “Location Analysis”, ISOLDE IX, Springer, Dordrecht, 349 pages, 2005.
  8. Ghiani, G., Laporte, G., Musmanno, R., Introduction to Logistics Systems Planning and Control, Wiley, Chichester, 352 pages, 2004. [This edition of the book won a prize.]
  9. Labbé, M., Laporte, G., Tanczos, K., Toint, P. (eds.), Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, NATO ASI Series F: Computers and Systems Sciences, Vol. 166, Springer, Berlin, 339 pages, 1998.
  10. Crainic, T.G., Laporte, G. (eds.), Fleet Management and Logistics, Kluwer, Boston, 251 pages, 1998..
  11. Laporte, G., Osman, I.H. (eds.), Metaheuristics in Combinatorial Optimization, Baltzer, Amsterdam, 630 pages, 1996.
  12. Gendreau, M., Laporte, G. (eds.), Passenger Transportation, Baltzer, Amsterdam, 242 pages, 1995.
  13. Gendreau, M., Laporte, G. (eds.), Freight Transportation, Baltzer, Amsterdam, 264 pages, 1995.
  14. Laporte, G., Ouellet, R., Inférence statistique : Théorie et problèmes résolus (troisième édition), Sciences et Culture, Montréal, 150 pages, 1989.
  15. Laporte, G., Ouellet, R., Théorie de la décision, Sciences et Culture, Montréal, 200 pages, 1989.
  16. Martello, S., Laporte, G., Minoux, M., Ribeiro, C. (eds.), Surveys in Combinatorial Optimization, North-Holland, Amsterdam, 384 pages, 1987.
  17. Laporte, G., Magnenat-Thalmann, N. (éds.), Applications du graphisme par ordinateur, Gaëtan Morin, Chicoutimi, 150 pages, 1984.
  18. Laporte, G., Ouellet, R., Probabilités et statistique : Théorie et problèmes résolus, Sciences et Culture, Montréal, 194 pages, 1982.
  19. Laporte, G. (éd.), Comptes rendus du congrès de l’Association des sciences administratives du Canada (Recherche opérationnelle), Montréal, 78 pages, 1980.
  20. Laporte, G., Ouellet, R., Problèmes et applications de probabilités et statistique, Sciences et Culture, Montréal, 231 pages, 1978.

Articles published in scientific journals

  1. Akyüz, M.H., Muter, İ., Erdoğan, G., Laporte, G., “Minimum Cost Delivery of Multi-Item Orders in E-Commerce Logistics”, Computers & Operations Research, 138, 105613, 2022.
  2. Canca, D., Laporte, G., “Solving a Real-Size Stochastic Railway Rapid Transit Network Construction Scheduling Problems”, Computers & Operations Research, 138, 105600, 2022.
  3. Yan, R., Wang, S., Zhen, L., Laporte, G., “Emerging Approaches Applied to Maritime Transport Research: Past and Future”, Communications in Transportation Research, 1, 100011, 2021.
  4. Battarra, M., Fraboni, F., Thomasson, O., Erdoğan, G., Laporte, G., Formentini, M., “Exact Algorithm for the Calzedonia Workload Allocation Problem”, Journal of the Operational Research Society, 72, 2004-2017, 2021.
  5. Kisialiou, Y., Gribkovskaia, I., Laporte, G., “Periodic Supply Vessel Planning under Demand and Weather Uncertainty”, INFOR: Information Systems and Operational Research, 59, 411-438, 2021.
  6. Vieira, B.S., Ribeiro, G.M., Bahiense, L., Cruz, R., Mendes, A.B., Laporte, G., “Exact and Heuristic Algorithms for the Fleet Composition and Periodic Routing Problem of Offshore Supply Vessels with Berth Allocation Decisions”, European Journal of Operational Research, 295, 908-923, 2021.
  7. Bruno, G., Cavola, M., Diglio, A., Laporte, G., Piccolo, C., “Reorganizing Postal Collection Operations in Urban Areas as a Result of Declining Mail Volumes – A Case Study in Bologna”, Journal of the Operational Research Society, 72, 1591-1606, 2021.
  8. Coindreau, M.-A., Gallay, O., Zufferey, N., Laporte, G., “Inbound and Outboud Flow Integration for Cross-Docking Operations”, European Journal of Operational Research, 294, 1153-1163, 2021.
  9. Özarık, S.S., Veelenturf, L.P., Van Woensel, T., Laporte, G., “Optimizing e-Commerce Last-Mile Vehicle Routing and Scheduling under Uncertain Customer Presence”, Transportation Research Part E: Logistics and Transportation Review, 148, 102263, 2021.
  10. Zhuge, D., Wang, S., Zhen, L., Laporte, G., “Subsidy Design under a Vessel Speed Reduction Incentive Program”, Naval Research Logistics, 68, 344-358, 2021.
  11. Schiffer, M., Klein, P.S., Laporte, G., Walther, G., “Integrated Planning for Electric Commercial Vehicle Fleets: A Case Study for Retail Mid-Haul Logistics Networks”, European Journal of Operational Research, 291, 944-960, 2021.
  12. Laganà, D., Laporte, G., Vocaturo, F., “A Dynamic Multi-Period General Routing Problem Arising in Postal Service and Parcel Delivery Systems”, Computers & Operations Research, 129, 105195, 2021.
  13. Arslan, O., Çulhan Kumcu, G., Kara, B.Y., Laporte, G., “The Location and Location-Routing Problem for the Refugee Camp Network Design”, Transportation Research Part B: Methodological, 143, 201-220, 2021.
  14. Wu, L., Wang, S., Laporte, G., “The Robust Bulk Ship Routing Problem with Dynamic Fleet Adjustment, Batched Cargo Selection, and Uncertain Voyage Costs”, Transportation Research Part B: Methodological, 143, 124-159, 2021.
  15. Yu, H., Sun, X., Solvang, W.D., Laporte, G., “Solving a Real-World Urban Postal Service Network Redesign Problem”, Scientific Programming, 2021, 3058474, 2021.
  16. Keskin, M., Çatay, B., Laporte, G., “A Simulation-Based Heuristic for the Electric Vehicle Routing Problem with Time Windows and Stochastic Waiting Times at Recharging Stations”, Computers & Operations Research, 125, 105060, 2021.
  17. Mladenović, M., Delot, T., Laporte, G., Wilbaut, C., “A Scalable Dynamic Parking Allocation Framework”, Computers & Operations Research, 125, 105080, 2021.
  18. Stellingwerf, H.M., Groeneveld, L.H.C., Laporte, G., Kanellopoulos, A., Bloemhof, J.M., Behdani, B., “The Quality-Driven Vehicle Routing Problem: Model and Application to a Case of Cooperative Logistics”, International Journal of Production Economics, 231, 107849, 2021.
  19. Moccia, L., Allen, D.W., Laporte, G., “A Spatially Disaggregated Model for the Technology Selection and Design of a Transit Line”, Public Transport, 12, 647-691, 2020.
  20. Guerriero, F., Macrina, G., Di Puglia Pugliese, L., Laporte, G., “Drone-Aided Routing: A Literature Review”, Transportation Research Part C: Emerging Technologies, 120, 102762, 2020.
  21. Yu, H., Sun, X., Solvang, W.D., Laporte, G., Lee, C.K.M., “A Stochastic Network Design Problem for Hazardous Waste Management”, Journal of Cleaner Production, 277, 123566, 2020.
  22. Zhen, L., Wu, Y., Wang, S., Laporte, G., “Green Technology Adoption for Fleet Deployment in a Shipping Network”, Transportation Research Part B: Methodological, 139, 388-410, 2020.
  23. Zhang, W., Wang, K., Wang, S., Laporte, G., “Clustered Coverage Orienteering Problem of Unmanned Surface Vehicles for Water Sampling”, Naval Research Logistics, 67(5), 353-367, 2020.
  24. Ponce, D., Contreras, I., Laporte, G., “E-Commerce Shipping Through a Third-Party Supply Chain”, Transportation Research Part E: Logistics and Transportation Review, 140, 101970, 2020.
  25. Arslan, O., Archetti, C., Jabali, O. Laporte, G., Speranza, M.G., “Minimum Cost Network Design in Strategic Alliances”, Omega: The International Journal of Management Science, 96, 102079, 2020.
  26. Zbib, H., Laporte, G., “The Commodity-Split Multi-Compartment Capacitated Arc Routing Problem”, Computers & Operations Research, 122, 104994, 2020.
  27. Koç, Ç., Laporte, G., Tükenmez, İ., “A Review of Vehicle Routing with Simultaneous Pickup and Delivery”, Computers & Operations Research, 122, 104987, 2020.
  28. Laporte, G., “Book Review. Sustainable Shipping: A Cross-Disciplinary View, Harilaos N. Psaraftis (ed.), 509 pages, Springer”, Maritime Economics & Logistics, 22, 326-327, 2020.
  29. Vidal, T., Laporte, G., Matl, P., “A Concise Guide to Existing and Emerging Vehicle Routing Problem Variants”, European Journal of Operational Research, 286(2), 401-416, 2020.
  30. Mladenović, M., Delot, T., Laporte, G., Wilbaut, C., “The Parking Allocation Problem for Connected Vehicles”, Journal of Heuristics, 26, 377-399, 2020.
  31. Arslan, O., Jabali, O., Laporte, G., “A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints”, INFORMS Journal on Computing, 32(1), 120-134, 2020.
  32. Zhuge, D., Wang, S., Zhen, L., Laporte, G., “Schedule Design for Liner Services under Vessel Speed Reduction Incentive Programs”, Naval Research Logistics, 67(1), 45-62, 2020.
  33. Macrina, G., Di Puglia Pugliese, L., Guerriero, F., Laporte, G., “Crowd-Shipping with Time Windows and Transshipment Nodes”, Computers & Operations Research, 113, 104806, 2020.
  34. Balçık, B., Silvestri, S., Rancourt, M.-È., Laporte, G., “Collaborative Prepositioning Network Design for Regional Disaster Response”, Production and Operations Management, 28(10), 2431-2455, 2019.
  35. Canca, D, De Los Santos, A., Laporte, G., Mesa, J.A.,  “The Railway Rapid Transit Network Construction Scheduling Problem”, Computers & Industrial Engineering, 138, 106075, 2019.
  36. Pelletier, S., Jabali, O., Mendoza, J.E., Laporte, G., “The Electric Bus Fleet Transition Problem”, Transportation Research Part C: Emerging Technologies, 109, 174-193, 2019.
  37. Fernández, E., Laporte, Rodríguez-Pereira, J., “Exact Solution of Several Families of Location-Arc Routing Problems”, Transportation Science, 53(5), 1313-1333, 2019.
  38. Ortíz-Astorquiza, C., Contreras, I., Laporte, G., “An Exact Algorithm for Multi-Level Uncapacitated Facility Location”, Transportation Science, 53(4), 1085-1106, 2019.
  39. Coindreau, M.-A., Gallay, O., Zufferey, N., Laporte, G., “Integrating Workload Smoothing and Inventory Reduction in Three Intermodal Cross-Docking Platforms of a European Car Manufacturer”, Computers & Operations Research, 112, 104762, 2019.
  40. Wølhk, S., Laporte, G., “A Districting-Based Heuristic for the Coordinated Capacitated Arc Routing Problem”, Computers & Operations Research, 111, 271-284, 2019.
  41. Pelletier, S., Jabali, O., Laporte, G., “The Electric Vehicle Routing Problem with Energy Consumption Uncertainty”, Transportation Research Part B: Methodological, 126, 225-255, 2019.
  42. Ghiami, Y., Demir, E., Van Woensel, T., Christiansen, M., Laporte, G., “A Deteriorating Routing Problem for an Inland Liquefied Natural Gas Distribution Network”, Transportation Research Part B: Methodological, 126, 45-67, 2019.
  43. Schiffer, M., Schneider, M., Walther, G., Laporte, G., “Vehicle Routing and Location-Routing with Intermediate Stops: A Review”, Transportation Science, 53(2), 319-343, 2019.
  44. Rodríguez-Pereira, J., Fernández, E., Laporte, G., Benavent, E., Martínez-Sykora, A., “The Steiner Traveling Salesman Problem and Its Extensions”, European Journal of Operational Research, 278(2), 615-628, 2019.
  45. Kisialiou, Y., Gribkovskaia, I., Laporte, G., “Supply Vessel Routing and Scheduling under Uncertain Demand”, Transportation Research Part C: Emerging Technologies, 104, 305-316, 2019.
  46. Canca, D., De Los Santos, A., Laporte, G., Mesa, J.A., “Integrated Railway Rapid Transit Network Design and Line Planning Problem with Maximum Profit”, Transportation Research Part E: Logistics and Transportation Review, 127, 1-30, 2019.
  47. Rohmer, S.U.K., Claassen, G.D.H., Laporte, G., “A Two-Echelon Inventory Routing Problem for Perishable Products”, Computers & Operations Research, 107, 156-172, 2019.
  48. Landete, M., Laporte, G., “Facility Location Problems with User Cooperation”, TOP, 27(1), 125-145, 2019.
  49. Belhaiza, S., M’Hallah, R., Ben Brahim, G., Laporte, G., “Three Multi-Start Data-Driven Evolutionary Heuristics for the Vehicle Routing Problem with Multiple Time Windows”, Journal of Heuristics, 25(3), 485-515, 2019.
  50. Koç, Ç., Mendoza, J.E., Jabali, O., Laporte, G., “The Electric Vehicle Routing Problem with Shared Charging Stations”, International Transactions in Operational Research, 26(4), 1211-1243, 2019.
  51. Keskin, M., Laporte, G., Çatay, B., “Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations”, Computers & Operations Research, 107, 77-94, 2019.
  52. Macrina, G., Laporte, G., Guerriero, F., Di Puglia Pugliese, L., “An Energy-Efficient Green-Vehicle Routing Problem with Mixed Vehicle Fleet, Partial Battery Recharging and Time Windows”, European Journal of Operational Research, 276(3), 971-982, 2019.
  53. Cherkesly, M., Landete, M., Laporte, G., “Median and Covering Location Problems with Interconnected Facilities”, Computers & Operations Research, 107, 1-18, 2019.
  54. Zhen, L., Li, M., Laporte, G., Wang, W., “A Vehicle Routing Problem Arising in Unmanned Aerial Monitoring”, Computers & Operations Research, 105, 1-11, 2019.
  55. Zhen, L., Hu, Y., Wang, S., Laporte, G., Wu, Y., “Fleet Deployment and Demand Fulfillment for Container Shipping Liners”, Transportation Research Part B: Methodological, 120, 15-32, 2019.
  56. Froger, A., Mendoza, J.E., Jabali, O., Laporte, G., “Improved Formulations and Algorithmic Components for the Electric Vehicle Routing Problem with Nonlinear Charging Functions”, Computers & Operations Research, 104, 256-294, 2019.
  57. Zhen, L., Wang, S., Laporte, G., Hu, Y., “Integrated Planning of Ship Deployment, Service Schedule and Container Routing”, Computers & Operations Research, 104, 304-318, 2019.
  58. Macrina, G., Di Puglia Pugliese, L., Guerriero, F., Laporte, G., “The Green Mixed Fleet Vehicle Routing Problem with Partial Battery Recharging and Time Windows”, Computers & Operations Research, 101, 183-199, 2019.
  59. Arslan, O., Jabali, O., Laporte, G., “Exact Solution of the Evasive Flow Capturing Problem”, Operations Research, 66(6), 1625-1640, 2018.
  60. Laporte, G., Meunier, F., Wolfler Calvo, R., “Shared Mobility Systems: An Updated Survey”, Annals of Operations Research, 271(1), 105-126, 2018.
  61. Wøhlk, S., Laporte, G., “A Fast Heuristic for Large-Scale Capacitated Arc Routing Problems”, Journal of the Operational Research Society, 69(12), 1877-1887, 2018.
  62. Stellingwerf, H.M., Laporte, G., Cruijssen, F.C.A.M., Kanellopoulos, A., Bloemhof, J.M., “Quantifying the Environmental and Economic Benefits of Cooperation: A Case Study in Temperature-Controlled Food Logistics”, Transportation Research Part D: Transport and Environment, 65, 178-193, 2018.
  63. Pelletier, S., Jabali, O., Laporte, G., “Charge Scheduling for Electric Freight Vehicles”, Transportation Research Part B: Methodological, 115, 246-269, 2018.
  64. He, L., Liu, X., Laporte, G., Chen, Y., Chen, Y., “An Improved Adaptive Large Neighborhood Search Algorithm for Multiple Agile Satellites Scheduling”, Computers & Operations Research, 100, 12-25, 2018.
  65. Nasri, M.I., Bektaş, T., Laporte, G., “Route and Speed Optimization for Autonomous Trucks”, Computers & Operations Research, 100, 89-101, 2018.
  66. Franceschetti, A., Honhon, D., Laporte, G., Van Woensel, T., “A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem”, Transportation Science, 52(4), 756-768, 2018.
  67. Wang, K., Zhen, L., Wang, S., Laporte, G., “Column Generation for the Integrated Berth Allocation, Quay Crane Assignment and Yard Assignment Problem”, Transportation Science, 52(4), 812-834, 2018.
  68. Corberán, Á., Erdoğan, G., Laporte, G., Plana, I., Sanchis, J.M., “The Chinese Postman Problem with Load-Dependent Costs”, Transportation Science, 52(2), 370-385, 2018.
  69. Fernández, E., Laporte, G., Rodríguez-Pereira, J., “A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem”, Transportation Science, 52(2), 353-369, 2018.
  70. Thomasson, O., Battarra, M., Erdoğan, G., Laporte, G., “Scheduling Twin Robots in a Palletising Problem”, International Journal of Production Research, 56(1-2), 518-542, 2018.
  71. Kisialiou, Y., Gribkovskaia, I., Laporte, G., “Robust Supply Vessel Routing and Scheduling”, Transportation Research Part C: Emerging Technologies, 90, 366-378, 2018.
  72. Kisialiou, Y., Gribkovskaia, I., Laporte, G., “The Periodic Supply Vessel Planning Problem with Flexible Departure Times and Coupled Vessels”, Computers & Operations Research, 94, 52-64, 2018.
  73. Ortíz-Astorquiza, C., Contreras, I., Laporte, G., “Multi-Level Facility Location Problems”, European Journal of Operational Research, 267(3), 791-805, 2018.
  74. Koç, Ç., Jabali, O., Laporte, G., “Long-Haul Vehicle Routing and Scheduling with Idling Options”, Journal of the Operational Research Society, 69(2), 235-246, 2018.
  75. 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, 266(2), 498-507, 2018.
  76. Koç, Ç., Laporte, G., “Vehicle Routing with Backhauls: Review and Research Perspectives”, Computers & Operations Research, 91, 79-91, 2018.
  77. Schiffer, M., Schneider, M., Laporte, G., “Designing Sustainable Mid-Haul Logistics Networks with Intra-Route Multi-Resource Facilities”, European Journal of Operational Research, 265(2), 517-532, 2018.
  78. Dufour, É., Laporte, G., Paquette, J., Rancourt, M.-È., “Logistics Service Network Design for Humanitarian Response in East Africa”, Omega: The International Journal of Management Science, 74, 1-14, 2018.
  79. Bulhões, T., Subramanian, A., Erdoğan, G., Laporte, G., “The Static Bike Relocation Problem with Multiple Vehicles and Visits”, European Journal of Operational Research, 264, 2, 508-523, 2018.
  80. Gutiérrez-Jarpa, G., Laporte, G., Marianov, V., “Corridor-Based Metro Network Design with Travel Flow Capture”, Computers & Operations Research, 89, 58-67, 2018.
  81. Flores-Garza, D.A., Salazar-Aguilar, M.A., Ngueveu, S.U., Laporte, G., “The Multi-Vehicle Cumulative Covering Tour Problem”, Annals of Operations Research, 258(2), 761-780, 2017.
  82. Franceschetti, A., Jabali, O., Laporte, G., “Continuous Approximation Models in Freight Distribution Management”, TOP, 25(3), 413-433, 2017.
  83. Ortíz-Astorquiza, C., Contreras, I., Laporte, G., “Formulations and Approximation Algorithms for Multi-Level Uncapacitated Facility Location”, INFORMS Journal on Computing, 29(4), 767-779, 2017.
  84. Palomo-Martínez, P.J., Salazar-Aguilar, M., Laporte, G., “Planning a Selective Delivery Schedule through Adaptive Large Neighborhood Search”, Computers & Industrial Engineering, 112, 368-378, 2017.
  85. Pelletier, S., Jabali, O., Laporte, G., Veneroni, M., “Battery degradation and behaviour for electric vehicles: Review and numerical analyses of several models”, Transportation Research Part B: Methodological, 103, 158-187, 2017.
  86. De Los Santos, A., Laporte, G., Mesa, J.A., Perea, F., “The Railway Line Frequency and Size Setting Problem”, Public Transport, 9, 33-53, 2017
  87. Moccia, L., Giallombardo, G., Laporte, G., “Models for Technology Choice in a Transit Corridor with Elastic Demand”, Transportation Research Part B: Methodological, 104, 733-756, 2017.
  88. 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, 263, 737-754, 2017.
  89. Wøhlk, S., Laporte, G., “Computational Comparison of Several Greedy Algorithms for the Minimum Cost Perfect Matching Problem on Large Graphs”, Computers & Operations Research, 87, 107-113, 2017.
  90. 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.
  91. 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.
  92. 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.
  93. Laporte, G., Ortega, F.A., Pozo, M.A., Puerto, J., “Multi-Objective Integration of Timetables, Vehicle Schedules and User Routing in a Transit Network”, Transportation Research Part B: Methodological, 98, 94-112, 2017.
  94. 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.
  95. 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.
  96. 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.
  97. Maknoon, Y., Laporte, G., “Vehicle Routing with Cross-Dock Selection”, Computers & Operations Research, 77, 254-266, 2017.
  98. 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.
  99. 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.
  100. Franceschetti, A., Honhon, D., Laporte, G., Van Woensel, T., Fransoo, J.C., “Strategic Fleet Planning for City Logistics”, Transportation Research Part B: Methodological, 95, 19-40, 2017.
  101. 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.
  102. 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.
  103. Silvestri, S., Laporte, G., Cerulli, R., “The Rainbow Cycle Cover Problem”, Networks, 68, 260-270, 2016.
  104. Koç, Ç., Bektaş, T., Jabali, O., Laporte, G., “A Comparison of Three Idling Options in Long-Haul Truck Scheduling”, Transportation Research Part B: Methodological, 93, 631-647, 2016.
  105. 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.
  106. 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.
  107. 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: Emerging Technologies, 70, 129-141, 2016.
  108. 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.
  109. 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.
  110. 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.
  111. Erdoğan, 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.
  112. 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.
  113. François, V., Arda, Y., Crama, Y., Laporte, G., “Large Neighborhood Search for Multi-trip Vehicle Routing”, European Journal of Operational Research, 255(2), 422-441, 2016
  114. 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.
  115. Coelho, L.C., Renaud, J., Laporte, G., “Road-Based Goods Transportation: A Survey of Real-World Applications from 2000 to 2015”, INFOR: Information Systems and Operational Research, 54(2), 79-96, 2016.
  116. 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.
  117. Solyalı, O., Cordeau, J.-F., Laporte, G., “The Impact of Modeling on Robust Inventory Management under Demand Uncertainty”, Management Science, 62(4), 1188-1201, 2016.
  118. Crainic T.G., Laporte, “Transportation in Supply Chain Management: Recent Advances and Research Prospects”, International Journal of Production Research, 54(2), 403-404, 2016.
  119. Pelletier, S., Jabali, O., Laporte, G., “Goods Distribution with Electric Vehicles: Review and Research Perspectives”, Transportation Science, 50(1), 3-22, 2016.
  120. Ortega, F.A., Barrena, E., Canca, D., Laporte, G., “Analyzing the Theoretical Capacity of Railway Networks with a Radial-Backbone Topology”, Transportation Research Part A: Policy and Practice, 84, 83-92, 2016.
  121. Laporte, G., “Scheduling Issues in Vehicle Routing”, Annals of Operations Research, 236(2), 463-474, 2016.
  122. 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.
  123. 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.
  124. 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.
  125. Koç, Ç., Bektaş, T., Jabali, O., Laporte, G., “The impact of depot location, fleet composition and routing on emissions in city logistics”, Transportation Research Part B: Methodological, 84, 81-102, 2016.
  126. Koç, Ç., Bektaş, T., Jabali, O., Laporte, G., “Thirty Years of Heterogeneous Vehicle Routing”, European Journal of Operational Research, 249(1), 1-21, 2016.
  127. Moccia, L., Laporte, G., “Improved Models for Technology Choice in a Transit Corridor with Fixed Demand”, Transportation Research, Part B: Methodological, 83, 245-270, 2016.
  128. Koç, Ç., Bektaş, 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.
  129. Taş, 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.
  130. 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.
  131. Laporte, G., Meunier, F., Wolfler Calvo, R., “Shared Mobility Systems”, 4OR: A Quarterly Journal of Operations Research, 13(4), 341-360, 2015.
  132. Ortíz-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.
  133. Norlund, E.K., Gribkovskaia, I., Laporte, G., “Supply Vessel Planning under Cost, Environment and Robustness Considerations”, Omega: The International Journal of Management Science, 57B, 271-281, 2015.
  134. 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.
  135. 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.
  136. 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.
  137. Koç, Ç., Bektaş, 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.
  138. Laporte, G., Pascoal, M.M.B., “Path Based Algorithms for Metro Networks Design”, Computers & Operations Research, 62, 78-94, 2015.
  139. 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.
  140. 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.
  141. 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.
  142. 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.
  143. 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.
  144. Lei, H., Laporte, G., Liu, Y., Zhang, T., “Dynamic design of sales territories”, Computers & Operations Research, 56, 84-92, 2015.
  145. 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.
  146. Bektaş, T., Laporte, G., Vigo, D., “Integrated Vehicle Routing Problems”, Computers & Operations Research, 55, page 126, 2015.
  147. 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: The International Journal of Management Science, 51, 1-10, 2015.
  148. Ghiani, G., Laporte, G., Manni, E., “Model-Based Automatic Neighborhood Design by Unsupervised Learning”, Computers & Operations Research, 54, 108-116, 2015.
  149. Laporte, G., “The Tube Challenge”, INFOR: Information Systems and Operational Research, 52(1), 10-13, 2014.
  150. 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.
  151. Demir, E., Bektaş, T., Laporte, G., “The Bi-Objective Pollution-Routing Problem”, European Journal of Operational Research, 232, 464-478, 2014.
  152. Salazar-Aguilar, M.A., Langevin, A., Laporte, G., “The Multi-District Team Orienteering Problem”, Computers & Operations Research, 41,76-82, 2014.
  153. 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.
  154. Demir, E., Bektaş, T., Laporte, G., “A Review of Recent Research on Green Road Freight Transportation”, European Journal of Operational Research, 237, 775-793, 2014.
  155. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Thirty Years of Inventory Routing”, Transportation Science, 48, 1-19, 2014.
  156. Albareda-Sambola, M., Fernández, E., Laporte, G., “The Dynamic Vehicle Routing Problem with Probabilistic Information”, Computers & Operations Research, 48, 31-39, 2014.
  157. Erdoğan, G., Battarra, M., Laporte, G., “Scheduling Twin Robots on a Line”, Naval Research Logistics, 61, 119-130, 2014.
  158. Coelho, L.C., Laporte, G., “Optimal Joint Replenishment, Delivery and Inventory Management Policies for Perishable Products”, Computers & Operations Research, 47, 42-52, 2014.
  159. Koç, Ç. Bektaş, T., Jabali, O., Laporte, G., “The Fleet Size and Mix Pollution-Routing Problem”, Transportation Research Part B: Methodological, 70, 239-254, 2014.
  160. 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.
  161. Muter, İ., 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.
  162. 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.
  163. 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.
  164. Coelho, L.C., Laporte, G., “A Comparison of Several Enumerative Algorithms for Sudoku”, Journal of the Operational Research Society, 65, 1602-1610, 2014.
  165. 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: Methodological, 68, 1-16, 2014.
  166. Butsch, A., Kalcsics, J., Laporte, G., “Districting for Arc Routing”, INFORMS Journal on Computing, 26, 809-824, 2014.
  167. 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.
  168. Erdoğan, G., Laporte, G., Wolfler Calvo, R., “The Static Bicycle Relocation Problem with Demand Intervals”, European Journal of Operational Research, 238, 451-457, 2014.
  169. 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.
  170. Barrena, E., Canca, D., Coelho, L.C., Laporte, G., “Single-Line Rapid Transit Timetabling with Dynamic Passenger Demand”, Transportation Research Part B: Methodological, 70, 134-150, 2014.
  171. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Heuristics for Dynamic and Stochastic Inventory-Routing”, Computers & Operations Research, 52, 55-67, 2014.
  172. Coelho, L.C., Laporte, G., “The Exact Solution of Several Classes of Inventory-Routing Problems”, Computers & Operations Research, 40, 558-565, 2013.
  173. Schmid, V., Doerner, K.F., Laporte, G., “Rich Routing Problems Arising in Supply Chain Management”, European Journal of Operational Research, 224, 435-448, 2013.
  174. Verma, M. Gendreau, M., Laporte, G., “Optimal Location and Capability of Oil Spill Response facilities for the South Coast of Newfoundland”, Omega: The International Journal of Management Science, 41, 856-867, 2013.
  175. Erdoğan, G., Laporte, G., “The Orienteering Problem with Variable Profits”, Networks, 61, 104-116, 2013.
  176. Rancourt, M.-È., Cordeau, J.-F., Laporte, G., “Long-Haul Vehicle Routing and Scheduling with Working Hour Rules”, Transportation Science, 47, 81-107, 2013.
  177. 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.
  178. 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.
  179. 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: Methodological, 52, 1-16, 2013.
  180. 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.
  181. Laporte, G., Toth, P., Vigo, D., “Vehicle Routing: Historical Perspective and Recent Contributions”, EURO Journal of Transportation and Logistics, 2, 1-4, 2013.
  182. 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
  183. 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.
  184. Franceschetti, A., Honhon, D., Van Woensel, T., Bektaş, T., Laporte, G., “The Time-Dependent Pollution-Routing Problem”, Transportation Research Part B: Methodological, 56, 265-293, 2013.
  185. 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.
  186. 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.
  187. 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.
  188. Erdoğan, 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.
  189. Salazar-Aguilar, M.A., Langevin, A., Laporte, G., “Synchronized Arc Routing for Snow Plowing Operations”, Computers & Operations Research, 39, 1432-1440, 2012.
  190. Qian, F., Gribkovskaia, I., Laporte, G., Halskau, Ø., “Passenger and Pilot Risk Minimization in Offshore Helicopter Transportation”, Omega: The International Journal of Management Science, 40, 584-593, 2012.
  191. Rakke, J.G., Christiansen, M. Fagerholt, K., Laporte, G., “The Travelling Salesman Problem with Draft Limits”, Computers & Operations Research, 39, 2161-2167, 2012.
  192. 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.
  193. 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.
  194. 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.
  195. Laporte, G., Pascoal, M.M.B., “The Pipeline and Valve Location Problem”, European Journal of Industrial Engineering, 6, 301-321, 2012.
  196. Coelho, L.C., Cordeau, J.-F., Laporte, G., “The Inventory-Routing Problem with Transshipment”, Computers & Operations Research, 39, 2537-2548, 2012.
  197. 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.
  198. Coelho, L.C., Cordeau, J.-F., Laporte, G., “Consistency in Inventory-Routing”, Transportation Research Part C: Emerging Technologies, 24, 270-287, 2012.
  199. 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.
  200. Lei, H., Laporte, G., Guo, B., “The Vehicle Routing Problem with Stochastic Demands and Split Deliveries”, INFOR: Information Systems and Operational research, 50, 59-71, 2012.
  201. Lei, H., Laporte, G., Guo, B., “Districting for Routing with Stochastic Customers”, EURO Journal on Transportation and Logistics, 1, 67-85, 2012.
  202. Bordenave, C., Gendreau, M., Laporte, G., “A Branch-and-Cut Algorithm for the Preemptive Swapping Problem”, Networks, 59, 387-399, 2012.
  203. 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.
  204. Jabali, O., Gendreau, M., Laporte, G., “A Continuous Approximation Model for the Fleet Composition Problem”, Transportation Research Part B: Methodological, 46, 1591-1606, 2012.
  205. Demir, E., Bektaş, T., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for the Pollution-Routing Problem”, European Journal of Operational Research, 223, 346-359, 2012.
  206. 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.
  207. 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.
  208. Solyalı, O., Cordeau, J.-F., Laporte, G., “Robust Inventory Routing under Demand Uncertainty”, Transportation Science, 46, 327-340, 2012.
  209. Limbourg, S. Schyns, M., Laporte, G., “Automatic Aircraft Cargo Load Planning”, Journal of the Operational Research Society, 63, 1271-1285, 2012.
  210. Duchenne, É., Laporte, G., Semet, F., “The Undirected m-Capacitated Peripatetic Salesman Problem”, European Journal of Operational Research, 223, 637-643, 2012.
  211. 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: Information Systems and Operational Research, 50, 195-204, 2012.
  212. Laporte, G., Pascoal, M.M.B., “Minimum Cost Path Problems with Relays”, Computers & Operations Research 38, 165-173, 2011.
  213. 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.
  214. 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.
  215. 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.
  216. 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.
  217. 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.
  218. Contreras, I., Cordeau, J.-F., Laporte, G., “The Dynamic Uncapacitated Hub Location Problem”, Transportation Science, 45, 18-32, 2011.
  219. 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.
  220. 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.
  221. Contreras, I., Cordeau, J.-F., Laporte, G., “Stochastic Uncapacitated Hub Location”, European Journal of Operational Research, 212, 518-528, 2011.
  222. Demir, E., Bektaş, T., Laporte, G., “A Comparative Analysis of Several Vehicle Emission Models for Freight Transportation”, Transportation Research Part D: Transport and Environment, 16, 347-357, 2011.
  223. Norstad, I., Fagerholt, K., Laporte, G., “Tramp Ship Routing and Scheduling with Speed Optimization”, Transportation Research Part C: Emerging Technologies, 19, 853-865, 2011.
  224. 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.
  225. Lei, H., Laporte, G., Guo, B., “The Capacitated Vehicle Routing Problem with Stochastic Demands and Time Windows”, Computers & Operations Research, 38, 1175-1183, 2011.
  226. Laporte, G., Mesa, J.A., Ortega, F.A., Perea, F., “Planning Rapid Transit Systems”, Socio-Economic Planning Sciences, 45, 95-104, 2011.
  227. 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.
  228. Bektaş, T., Laporte, G., “The Pollution-Routing Problem”, Transportation Research Part B: Methodological, 45, 1232-1250, 2011.
  229. De Los Santos, A., Laporte, G., Mesa, J.A., Perea, F.,”Evaluating Passenger Robustness in a Railway Transit Network”, Transportation Research Part C: Emerging Technologies, 20, 34-46, 2011.
  230. Anily, S., Gendreau, M., Laporte, G., “The Preemptive Swapping Problem on a Tree”, Networks, 58, 83-94, 2011.
  231. Perugia, A., Moccia, L., Cordeau, J.-F., Laporte, G., “Designing a Home-to-Work Bus Service in a Metropolitan Area”, Transportation Research Part B: Methodological, 45, 1710-1726, 2011.
  232. Contreras, I., Cordeau, J.-F. Laporte, G.. ”Benders Decomposition for Large-Scale Uncapacitated Hub Location”, Operations Research, 59, 1477-1490, 2011.
  233. Bozkaya, B., Erkut, E., Haight, D., Laporte, G., “Designing New Electoral Districts for the City of Edmonton”, Interfaces, 41, 534-547, 2011.
  234. 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.
  235. 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.
  236. Baldacci, R., Bartolini, E., Laporte, G., “Some Applications of the Generalized Vehicle Routing Problem”, Journal of the Operational Research Society, 61, 1072-1077, 2010.
  237. 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.
  238. Cordeau, J.-F., Laporte, G., Pasin, F., Ropke, S., “Scheduling Technicians and Tasks in a Telecommunications Company”, Journal of Scheduling, 13, 393-409, 2010.
  239. Erdoğan, 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.
  240. 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.
  241. Battarra, M., Erdoğan, G., Laporte, G., Vigo, D., “The Traveling Salesman Problem with Pickups, Deliveries and Handling Costs”, Transportation Science, 44, 383-399, 2010.
  242. 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.
  243. Laporte, G., “Comments on ‘Routing Problems with Loading Constraints’, by Manuel Iori and Silvano Martello”, TOP, 18, 28-30, 2010.
  244. Heilporn, G., Cordeau, J.-F., Laporte, G., “The Delivery Man Problem with Time Windows”, Discrete Optimization, 7, 269-282, 2010.
  245. Erdoğan, G., Erkut, E., Ingolfsson, A., Laporte, G., “Scheduling Ambulance Crews for Maximum Coverage”, Journal of the Operational Research Society, 61, 543-550, 2010.
  246. 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.
  247. 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.
  248. Laporte, G., Mesa, J.A., Perea, F., “A Game Theoretic Framework for the Robust Railway Network Design Problem”, Transportation Research Part B: Methodological, 44, 447-459, 2010.
  249. Wen, M., Cordeau, J.-F., Laporte, G., Larsen, J., “The Dynamic Multi-Period Vehicle Routing Problem”, Computers & Operations Research, 37, 1615-1623, 2010.
  250. Touhami, S., Bourjolly, J.-M., Laporte, G., “Optimizing Hopping Sequences in Frequency Hopping Cellular Networks”, Engineering Optimization, 42, 33-44, 2010.
  251. 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.
  252. Beaudry, A., Laporte, G., Melo, T., Nickel, S., “Dynamic Transportation of Patients in Hospitals”, Operations Research Spectrum, 32, 77-107, 2010.
  253. 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.
  254. Bordenave, C., Gendreau, M., Laporte, G., “Heuristics for the Mixed Swapping Problem”, Computers & Operations Research, 37, 108-114, 2010.
  255. Laporte, G., “A Concise Guide to the Traveling Salesman Problem”, Journal of the Operational Research Society, 61, 35-40, 2010.
  256. Erdoğan, G., Cordeau, J.-F., Laporte, G., “The Attractive Traveling Salesman Problem”, European Journal of Operational Research, 203, 59-69, 2010.
  257. 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.
  258. Berbeglia, G., Cordeau, J-F., Laporte, G., “Dynamic Pickup and Delivery Problems”, European Journal of Operational Research, 202, 8-15, 2010.
  259. 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.
  260. Chan, T., Cordeau, J.-F., Laporte, G., “Locating Satellite Yards in Forestry Operations”, INFOR: Information Systems and Operational Research, 47, 223-234, 2009.
  261. Laporte, G., “Fifty Years of Vehicle Routing”, Transportation Science, 43, 408-416, 2009.
  262. 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.
  263. Bordenave, C., Gendreau, M., Laporte, G., “A Branch-and-Cut Algorithm for the Non-Preemptive Swapping Problem”, Naval Research Logistics, 56, 478-486, 2009.
  264. 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|
  265. 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.
  266. Hien, N., Laporte, G., Roy, J., “Business Environment Factors, Incoterms Selection and Export Performance”, Operations and Supply Chain Management, 2, 63-78, 2009.
  267. 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.
  268. 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.
  269. Paquette, J., Cordeau, J.-F., Laporte, G., “Quality of Service in Dial-a-ride Operations”, Computers & Industrial Engineering, 56, 1721-1734, 2009.
  270. Duchenne, É., Laporte, G., Semet, F., “Heuristiques pour le problème du vendeur m-péripatétique”, RAIRO (Recherche opérationnelle), 43, 13-26, 2009.
  271. 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.
  272. Erdoğan, 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.
  273. 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.
  274. Cornillier, F., Laporte, G., Boctor, F.F., Renaud, J., “The Petrol Station Replenishment Problem with Time Windows”, Computers & Operations Research, 36, 919-935, 2009.
  275. Öncan, T., Altınel, İ.K., Laporte, G., “A Comparative Analysis of Several Asymmetric Traveling Salesman Problem Formulations”, Computers & Operations Research, 36, 637-654, 2009.
  276. Albareda Sambola, M., Fernández, E., Laporte, G., “The Capacity and Distance Constrained Plant Location Problem”, Computers & Operations Research, 36, 597-611, 2009.
  277. 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.
  278. 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.
  279. Laporte, G., “Operational Research: Milestones and Highlights of Canadian Contributions”, INFOR: Information Systems and Operational Research, 46, 309-312, 2008.
  280. Pureza, V., Laporte, G., “Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows”, INFOR: Information Systems and Operational Research, 46, 165-175, 2008.
  281. Bektaş, 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.
  282. 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.
  283. 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.
  284. 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.
  285. Cordeau, J.-F., Laporte, G., Pasin, F., “Iterated Tabu Search for the Car Sequencing Problem”, European Journal of Operational Research, 191, 945-956, 2008.
  286. 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.
  287. Öncan, 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.
  288. 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.
  289. 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.
  290. Bektaş, 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.
  291. 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.
  292. 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.
  293. Farahani, R.Z., 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.
  294. 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.
  295. 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.
  296. Gribkovskaia, I., Laporte, G., Shyshou, A., “The Single Vehicle Routing Problem with Deliveries and Selective Pickups”, Computers & Operations Research, 35, 2908-2924, 2008.
  297. 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.
  298. Dubuc, G., Bektaş, T., Cordeau, J.-F., Laporte, G., “Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique”, INFOR: Information Systems and Operational Research, 45, 175-185, 2007.
  299. Paquette, J., Cordeau, J.-F., Laporte, G., “Étude comparative de divers modèles pour le problème de transport à la demande”, INFOR: Information Systems and Operational Research 45, 95-110, 2007.
  300. Gingras, C., Cordeau, J.-F., Laporte, G., “Un algorithme de minimisation du transport à vide appliqué à l’industrie forestière”, INFOR: Information Systems and Operational Research, 45, 41-47, 2007.
  301. Laporte, G., “What You Should Know about the Vehicle Routing Problem”, Naval Research Logistics, 54, 811-819, 2007.
  302. 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.
  303. Duchenne, É., Laporte, G., Semet, F., “The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms”, Operations Research, 55, 949-965, 2007.
  304. 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.
  305. 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.
  306. Cordeau, J.-F., Laporte, G., “The Dial-a-Ride Problem: Models and Algorithms”, Annals of Operations Research, 153, 29-46, 2007.
  307. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., “Static Pickup and Delivery Problems: A Classific,ation Scheme and Survey”, TOP, 15, 1-31, 2007 (discussions: 32-44; rejoinder: 45-47).
  308. Laporte, G., Rodríguez-Martín, I., “Locating a Cycle in a Transportation or a Telecommunications Network”, Networks, 50, 92-108, 2007.
  309. 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.
  310. 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.
  311. 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.
  312. 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.
  313. Gribkovskaia, I., Halskau, Ø., Laporte, G., “The Bridges of Königsberg – A Historical Perspective”, Networks, 49, 199-203, 2007.
  314. 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.,
  315. Gribkovskaia, I., Halskau, Ø., Laporte, G., Vlček, M., “General Solutions to the Single Vehicle Routing Problem with Pickups and Deliveries”, European Journal of Operational Research, 180, 568-584, 2007.
  316. 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.
  317. 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.
  318. 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.
  319. 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.
  320. Asef-Vaz,iri, 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.
  321. Laporte, G., Farahani, R.Z., Miandoabchi, E., “Designing an Efficient Method for Tandem AGV Network Design Problem Using Tabu Search”, Applied Mathematics and Computation, 183, 1410-1421, 2006.
  322. 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.
  323. 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.
  324. 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
  325. Mitrović-Minić, S., Laporte, G., “The Pickup and Delivery Problem with Time Windows and Transshipment”, INFOR: Information Systems and Operational Research 44, 217-227, 2006.
  326. 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
  327. 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.
  328. Touhami, S., Bourjolly, J.-M., Laporte, G., “Antenna Positioning in Mobile Telecommunication Networks”, INFOR: Information Systems and Operational Research, 44, 157-174, 2006.
  329. Costa, A.M., Cordeau, J.-F., Laporte, G., “Steiner Tree Problems with Profits”, INFOR: Information Systems and Operational Research, 44, 99-115, 2006.
  330. Ghiani, G., Laporte, G., Semet, F., “The Black and White Traveling Salesman Problem”, Operations Research, 54, 366-378, 2006.
  331. 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.
  332. 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.
  333. 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.
  334. Arriola, R., Laporte, G., Ortega, F. A., “The Weber Problem in a Multi-Storey Building”, INFOR: Information Systems and Operational Research, 43, 157-169, 2005.
  335. Cordeau, J.-F., Laporte, G., “Maximizing the Value of an Earth Observation Satellite Orbit”, Journal of the Operational Research Society, 56, 962-968, 2005.
  336. Laporte, G., “Comments on ‘Towards a Unified Territorial Design Approach: Applications, Algorithms and GIS Integration’, by Kalcsics, Nickel and Schröder”, TOP, 13, 62-64, 2005.
  337. 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.
  338. Farahani, R.Z., 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.
  339. Dasci, A., Laporte, G., “A Continuous Model for Multi-Store Competitive Location”, Operations Research, 53, 263-280, 2005.
  340. 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.
  341. 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.
  342. Asef-Vaziri, A., Laporte, G., “Loop Based Facility Planning and Material Handling”, European Journal of Operational Research, 164, 1-11, 2005.
  343. 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.
  344. 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.
  345. Hall, N.G., Laporte, G., Selvarajah, E., Sriskandarajah, C., “Scheduling and Lot Streaming in Openshops with No-Wait in Process”, Naval Research Logistics, 52, 261-275, 2005.
  346. 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.
  347. 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.
  348. 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.
  349. Mitrović-Minić, S., Krishnamurti, R., Laporte, G., “Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows”, Transportation Research B: Methodological, 38, 669-685, 2004.
  350. Mitrović-Minić, S., Laporte, G.,”Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Windows”, Transportation Research B: Methodological, 38, 635-655, 2004.
  351. 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.
  352. 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.
  353. 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.
  354. 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.
  355. Feremans, C., Labbé, M., Laporte, G., “The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm”, Networks, 43, 71-86, 2004.
  356. Renaud, J., Boctor, F.F., Laporte, G., “Efficient Heuristics for Median Cycle Problems”, Journal of the Operational Research Society, 55, 179-186, 2004.
  357. 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.
  358. 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.
  359. Boctor, F.F., Laporte, G., Renaud, J., “Models and Algorithms for the Dynamic-Demand Joint Replenishment Problem”, International Journal of Production Research, 42, 2667-2678, 2004.
  360. Laporte, G., Semet, F., Salazar-González, J.J., “Exact Algorithms for the Job Sequencing and Tool switching Problem”, IIE Transactions, 36, 37-45, 2004.
  361. 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.
  362. 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.
  363. 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.
  364. 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.
  365. Blais, M., Laporte, G., “Exact Solution of the Generalized Routing Problem through Graph Transformations”, Journal of the Operational Research Society, 54, 906-910, 2003.
  366. 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.
  367. Cordeau, J.-F., Laporte, G., “A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem”, Transportation Research Part B: Methodological, 37, 579-594, 2003.
  368. Brotcorne, L., Laporte, G., Semet, F. “Ambulance Location and Relocation Models”, European Journal of Operational Research, 148, 451-463, 2003.
  369. Feremans, C., Labbé, M., Laporte, G., “Generalized Network Design Problems”, European Journal of Operational Research, 148, 1-13, 2003.
  370. Boctor, F.F., Laporte, G., Renaud, J., “Heuristics for the Traveling Purchaser Problem”, Computers & Operations Research, 30, 491-504, 2003.
  371. Bourgeois, M., Laporte, G., Semet, F., “Heuristics for the Black and White Traveling Salesman Problem”, Computers & Operations Research, 30, 75-85, 2003.
  372. 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.
  373. Hall, N.G., Laporte, G., Selvarajah, E., Sriskandarajah, C., “Scheduling and Lot Streaming in Flowshops with No-Wait in Process”, Journal of Scheduling, 6, 339-354, 2003.
  374. 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.
  375. 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.
  376. Bruno, G., Laporte, G., “An Interactive Decision Support System for the Design of Rapid Public Transit Networks”, INFOR: Information Systems and Operational Research, 40, 111-118, 2002.
  377. Laporte, G., Palekar, U., “Some Applications of the Clustered Travelling Salesman Problem”, Journal of the Operational Research Society, 53, 972-976, 2002.
  378. 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.
  379. 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.
  380. Feremans, C., Labbé, M., Laporte, G., “A Comparative Analysis of Several Formulations for the Generalized Minimum Spanning Tree Problem”, Networks, 39, 29-34, 2002.
  381. Renaud, J., Boctor, F.F., Laporte, G., “Perturbation Heuristics for the Pickup and Delivery Traveling Salesman Problem”, Computers & Operations Research, 29, 1129-1141, 2002.
  382. Brotcorne, L., Laporte, G., Semet, F. “Fast Heuristics for Large Scale Covering-Location Problems, Computers & Operations Research, 29, 651-665, 2002.
  383. Laporte, G., Mesa, J.A., Ortega, F.A., “Locating Stations on Rapid Transit Lines”, Computers & Operations Research, 29, 741-759, 2002.
  384. Bruno, G., Gendreau, M., Laporte, G., “A Heuristic for the Location of a Rapid Transit Line”, Computers & Operations Research, 29, 1-12, 2002.
  385. Bourjolly, J.-M., Laporte, G., Pesant, G., “An Exact Algorithm for the Maximum k-Club in an Undirected Graph”, European Journal of Operational Research, 138, 21-28, 2002.
  386. 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.
  387. Feremans, C., Labbé, M., Laporte, G., “On Generalized Minimum Spanning Trees”, European Journal of Operational Research, 134, 457-458, 2001.
  388. Clossey, J., Laporte, G., Soriano, P. “Solving Arc Routing Problems with Turn Penalties”, Journal of the Operational Research Society, 52, 463-469, 2001.
  389. 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.
  390. Cordeau, J.-F., Laporte, G., “A Tabu Search Heuristic for the Site Dependent Vehicle Routing Problem with Time Windows”, INFOR: Information Systems and Operations Research, 39, 292-298, 2001.
  391. Ghiani, G., Improta, G., Laporte, G., “The Capacitated Arc Routing Problem with Intermediate Facilities”, Networks, 37, 134-143, 2001.
  392. Gendreau, M., Morais-Guimarães, E., Laporte, G., “A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times”, European Journal of Operational Research 133 (1), 183-189, 2001.
  393. Ghiani, G, Laporte, G., “Location-Arc Routing Problems”, Opsearch, 38, 151-159, 2001.
  394. Gourdin, É., Labbé, M., Laporte, G., “The Uncapacitated Facility Location Problem with Client Matching”, Operations Research, 48, 671-685 2000.
  395. Laporte, G., Gendreau, M., Potvin, J.-Y., Semet, F., “Classical and Modern Heuristics for the Vehicle Routing Problem”, International Transactions in Operational Research, 7, 285-300, 2000.
  396. Asef-Vaziri, A., Laporte, G., Sriskandarajah, C., “The Block Layout Shortest Loop Design Problem”, IIE Transactions, 32, 727-734, 2000.
  397. Ghiani, G., Laporte, G., “A Branch-and-Cut Algorithm for the Undirected Rural Postman Problem”, Mathematical Programming, 87, 467-481, 2000.
  398. Hertz, A., Laporte, G., Mittaz, M., “A Tabu Search Heuristic for the Capacitated Arc Routing Problem”, Operations Research, 48, 129-135, 2000.
  399. Gendreau, M., Laporte, G., Parent, I., “Heuristics for the Location of Inspection Stations on a Network”, Naval Research Logistics, 47, 287-303, 2000.
  400. Hachicha, M., Hodgson, M.J., Laporte, G., Semet, F., “Heuristics for the Multi-Vehicle Covering Tour Problem”, Computers & Operations Research, 27, 29-42, 2000.
  401. Anily, S., Gendreau, M., Laporte, G, “The Swapping Problem on a Line”, SIAM Journal on Computing, 29, 327-335, 2000.
  402. Anily, S., Gendreau, M., Laporte, G., “Optimal Sequencing of Tasks on a Tree Shaped Structure”, Ricerca Operativa, 29, 3-14, 2000.
  403. Weintraub, A., Aboud, J., Fernández, C., Laporte, G., Ramírez, E., “Sistema para el Despacho de Vehículos de Emergencia de una Empresa Eléctrica en Chile”, Revista Ingeniera de Sistemas, XIV (1), 3-18, 2000.
  404. Bourjolly, J.-M., Laporte, G., Pesant, G., “Heuristics for Finding k-Clubs in an Undirected Graph”, Computers & Operations Research, 27, 559-569 2000.
  405. Laporte, G., Mesa, J.A., Ortega, F., “Optimization Methods for the Planning of Rapid Transit Lines”, European Journal of Operational Research, 122, 1-10, 2000.
  406. Laporte, G., “The Art and Science of Designing Rotating Schedules”, Journal of the Operational Research Society, 50, 1011-1017, 1999.
  407. Ghiani, G., Laporte, G., “Eulerian Location Problems”, Networks, 34, 291-302.1999.
  408. Laporte, G., Semet, F., “An Optimality Cut for Mixed Integer Linear Programs”, European Journal of Operational Research, 119, 671-677, 1999.
  409. Serra, D., Eiselt, H.A., Laporte, G., ReVelle, C.S., “Market Capture Models under Various Customer Choice Rules”, Environment and Planning B, 26, 741-750, 1999.
  410. Laporte, G., Semet, F., “Computational Evaluation of a Transformation Procedure for the Symmetric Generalized Traveling Salesman Problem”, INFOR: Information Systems and Operational Research, 37, 114‑120, 1999.
  411. Weintraub, A., Aboud, J., Fernández, C., Laporte, G., Ramirez, E., “An Emergency Vehicle Dispatching System for an Electric Utility in Chile”, Journal of the Operational Research Society, 50, 690-696, 1999.
  412. Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, É.D., “A Tabu Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem”, Computers & Operations Research, 26, 1153-1173, 1999.
  413. Hertz, A., Laporte, G., Nanchen-Hugo, P., “Improvement Procedures for the Undirected Rural Postman Problem”, INFORMS Journal on Computing, 11, 53-62, 1999.
  414. Gendreau, M., Laporte, G., Vigo, D., “Heuristics for the Traveling Salesman Problem with Pickup and Delivery”, Computers & Operations Research, 26, 699-714, 1999.
  415. Mbaraga, P., Langevin, A., Laporte, G., “Two Exact Algorithms for the Vehicle Routing Problem on Trees”, Naval Research Logistics, 46, 75-89, 1999.
  416. Brotcorne, L., Farand, L., Laporte, G., Semet, F., “Impact des nouvelles technologies sur la gestion des véhicules d’urgence”, Ruptures 6, 149-168, 1999.
  417. Eiselt, H.A., Laporte, G., “Demand Allocation Functions”, Location Science, 6, 175-187, 1998.
  418. Laporte, G., Semet, F., Dadeshidze, V.V., Olsson, L.J.  “A Tiling and Routing Heuristic for the Screening of Cytological Samples”, Journal of the Operational Research Society, 49, 1233-1238, 1998.
  419. Gendreau, M., Laporte, G., Semet, F, “A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem”, Networks, 32, 263-273, 1998.
  420. Hertz, A., Laporte, G., Mittaz, M., Stecke, K.E., “Heuristics for Minimizing Tool Switches over Time on a Flexible Machine”, IIE Transactions, 30, 689‑694, 1998.
  421. Hodgson, M.J., Laporte G., Semet, F., “A Covering Tour Model for Planning Mobile Health Care Facilities in Suhum District, Ghana”, Journal of Regional Science, 38, 621-638, 1998.
  422. Banerjea-Brodeur, M., Cordeau, J.-F., Laporte, G., Lasry, A., “Scheduling Linen Deliveries in a Large Hospital”, Journal of the Operational Research Society, 49, 777-780, 1998.
  423. Gendreau, M., Hertz, A., Laporte, G., Stan, M., “A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows”, Operations Research, 43, 330-335, 1998.
  424. Labbé, M., Laporte, G., Soriano, P., “Covering a Graph with Cycles”, Computers & Operations Research, 25, 499-504, 1998.
  425. Gendreau, M., Laporte, G., Semet, F., “A Tabu Search Heuristic for the Undirected Selective Traveling Salesman Problem”, European Journal of Operational Research, 106, 539-545, 1998.
  426. Laporte, G., Lopes, L., Soumis, F., “Optimal Sequencing Rules for Some Large Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics”, International Journal of Flexible Manufacturing Systems, 10, 27-42, 1998.
  427. Gendreau, M., Laporte G., Semet, F., “Solving an Ambulance Location Problem by Tabu Search”, Location Science, 5, 75-88, 1997.
  428. Laporte, G., “Tour Location Problems”, Studies in Locational Analysis, 11, 13-26, 1997.
  429. Gendreau, M., Laporte, G., Yelle, S.Y., “Efficient Routing of Service Vehicles”, Engineering Optimization, 28, 263-271, 1997.
  430. Laporte, G., Mesa, J.A., Ortega, F.A., “Assessing the Efficiency of Rapid Transit Configurations”, TOP, 5, 95-104, 1997.
  431. Laporte G., “Modeling and Solving Several Classes of Arc Routing Problems as Traveling Salesman Problems”, Computers & Operations Research, 24, 1057-1061, 1997.
  432. Gendreau, M., Hertz, A., Laporte, G., “An Approximation Algorithm for the Traveling Salesman Problem with Backhauls”, Operations Research, 45, 639-641, 1997.
  433. Gendreau, M., Laporte, G., Semet, F., “The Covering Tour Problem”, Operations Research, 45, 568-576, 1997.
  434. Cordeau, J.-F., Gendreau, M., Laporte, G., “A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems”, Networks, 30, 105-119, 1997.
  435. Sharaiha, Y.M., Gendreau, M., Laporte, G., Osman, I.H., “A Tabu Search Algorithm for the Capacitated Shortest Spanning Tree Problem”, Networks, 29, 161‑171, 1997.
  436. Crainic, T.G., Laporte, G., “Planning Models for Freight Transportation”, European Journal of Operational Research, 97, 409-438, 1997.
  437. Golden, B.L., Laporte, G., Taillard, É.D., “An Adaptive Memory Heuristic for a Class of Vehicle Routing Problems with Minmax Objective”, Computers & Operations Research, 24, 445-452, 1997.
  438. Eiselt, H.A., Laporte, G., “Sequential Location Problems”, European Journal of Operational Research, 96, 217-231, 1997.
  439. De Meulemeester, L., Laporte, G., Louveaux, F.V., Semet, F., “Optimal Sequencing of Skip Collections and Deliveries”, Journal of the Operational Research Society, 48, 57-64, 1997.
  440. Bourjolly, J.-M., Laporte, G., Mercure, H., “A Combinatorial Column Generation Algorithm for the Maximum Clique and Stable Set Problems”, Operations Research Letters, 20, 21-29, 1997.
  441. Gendreau, M., Laporte, G., Potvin, J.-Y., “Heuristics for the Clustered Traveling Salesman Problem”, Combinatorial Optimization, 1, 41-56, 1996
  442. ReVelle, C.S., Laporte, G., “The Plant Location Problem: New Models and Research Prospects”, Operations Research, 44, 864-874, 1996.
  443. Laporte, G., Potvin, J.-Y., Quilleret, F., “A Tabu search Heuristic Using Genetic Diversification for the Clustered Traveling Salesman Problem”, Journal of Heuristics, 2, 187-200, 1996.
  444. Carter, M.W., Farvolden, J.M., Laporte, G., Xu, J., “Solving an Integrated Logistics Problem Arising in Grocery Distribution”, INFOR: Information Systems and Operational Research, 34, 290-306, 1996.
  445. Eiselt, H.A., Laporte, G., “Equilibrium Results in Competitive Location Models”, Middle East Forum, 1, 63-92, 1996.
  446. Laporte, G., Asef-Vaziri, A., Sriskandarajah, C., “Some Applications of the Generalized Traveling Salesman Problem”, Journal of the Operational Research Society, 47, 1461-1467, 1996.
  447. Taillard, É.D., Laporte, G., Gendreau, M., “Vehicle Routing with Multiple Use of Vehicles”, Journal of the Operational Research Society, 47, 1065-1070, 1996.
  448. França, P.M., Gendreau, M., Laporte, G., Müller, F.M., “A Tabu Search Heuristic for the Multiprocessor Scheduling Problem with Sequence Dependent Setup Times”, International Journal of Production Economics, 43, 79-89, 1996.
  449. Gendreau, M., Laporte, G., Séguin, R., “A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers”, Operations Research, 44, 469-477, 1996.
  450. Osman, I.H., Laporte, G., “Metaheuristics in Combinatorial Optimization: A Bibliography”, Annals of Operations Research, 63, 513-628, 1996.
  451. Dufourd, H., Gendreau, M., Laporte, G., “Locating a Transit Line Using Tabu Search”, Location Science, 4, 1-19, 1996.
  452. Eiselt, H.A., Gendreau, M., Laporte, G., “Optimal Location of Facilities on a Network with an Unreliable Node or Link”, Information Processing Letters, 58, 71-74, 1996.
  453. Renaud, J., Laporte, G., Boctor, F.F., “A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem”, Computers & Operations Research, 23, 229-235, 1996.
  454. Renaud, J., Boctor, F.F., Laporte, G., “An Improved Petal Heuristic for the Vehicle Routing Problem”, Journal of the Operational Research Society, 47, 329-336, 1996.
  455. Carter, M.W., Laporte, G., Lee, S.Y., “Examination Timetabling: Algorithmic Strategies and Applications”, Journal of the Operational Research Society, 47, 373-383, 1996.
  456. Gendreau, M., Hertz, A., Laporte, G., “The Traveling Salesman Problem with Backhauls”, Computers & Operations Research, 23, 501-508, 1996.
  457. Gendreau, M., Laporte, G., Séguin, R., “Stochastic Vehicle Routing”, European Journal of Operational Research, 88, 3-12, 1996.
  458. Laporte, G., Osman, I.H., “Routing Problems: A Bibliography”, Annals of Operations Research, 61, 227-262, 1996.
  459. Renaud, J., Boctor, F.F., Laporte, G., “A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem”, INFORMS Journal on Computing, 8, 134-143, 1996.
  460. Bourjolly, J.-M., Gaboune, B., Laporte, G., Soumis, F., “Optimal Policies for Some Discrete Sequencing Problems Arising in Flexible Manufacturing”, Computers & Industrial Engineering, 28, 301-307, 1995.
  461. Laporte, G., “Comments on “Multiobjective Routing Problems” by T.B. Boffey”, TOP, 3, 206‑213, 1995.
  462. Crainic, T.G., Gendreau, M., Laporte, G., Lardinois, C., “Parallel Computing: New Opportunities for Transportation Research”, Scientia Iranica, 2, 231-244, 1995.
  463. Gendreau, M., Laporte, G., Séguin, R., “The Vehicle Routing Problem with Stochastic Demands and Customers”, Transportation Science, 29, 143-155, 1995.
  464. Gendreau, M., Labbé, M., Laporte, G., “Efficient Heuristics for the Design of Ring Networks”, Telecommunication Systems, 4, 177-188, 1995.
  465. Eiselt, H.A., Gendreau, M., Laporte, G., “Arc Routing Problems, Part I: The Chinese Postman Problem”, Operations Research, 43, 231-242, 1995.
  466. Eiselt, H.A., Gendreau, M., Laporte, G., “Arc Routing Problems, Part II: The Rural Postman Problem”, Operations Research, 43, 399-414, 1995.
  467. Labbé, M., Laporte, G., Martello, S., “An Exact Algorithm for the Dual Bin Packing Problem”, Operations Research Letters, 17, 9-18, 1995.
  468. Gendreau, M., Laporte, G., Solomon, M.M., “Single Vehicle Routing and Scheduling to Minimize the Number of Delays”, Transportation Science 29, 56-62, 1995.
  469. Gendreau, M., Laporte, G., Mesa, J.A., “Locating Rapid Transit Lines”, Journal of Advanced Transportation, 29, 145-162, 1995.
  470. França, P.M., Gendreau, M., Laporte, G., Müller, F.M., “The m‑Traveling Salesman Problem with Minmax Objective”, Transportation Science, 29, 267‑275, 1995.
  471. Eiselt, H.A., Gendreau, M., Laporte, G., “Measuring Spatial Agglomeration-The Case of Shopping Malls”, Studies on Regional & Urban Planning, 3, 101-125, 1994.
  472. Gendreau, M., Hertz, A., Laporte, G., “A Tabu Search Algorithm for the Vehicle Routing Problem”, Management Science, 40, 1276-1290, 1994.
  473. Laporte, G., Louveaux, F.V., Mercure, H., “A Priori Optimization of the Probabilistic Traveling Salesman Problem”, Operations Research, 42, 543-549, 1994.
  474. Laporte, G., Louveaux, F.V., Van hamme, L., “Exact Solution of a Stochastic Location Problem by an Integer L-Shaped Algorithm”, Transportation Science, 28, 95-103, 1994.
  475. Gendreau, M., Hertz, A., Laporte, G., “A Generalized Insertion Algorithm for the Seriation Problem”, Mathematical and Computer Modelling, 19, 53-59, 1994.
  476. Dror, M., Laporte, G., Trudeau, P., “Vehicle Routing with Split Deliveries”, Discrete Applied Mathematics, 50, 239-254, 1994.
  477. Carter, M.W., Laporte, G., Chinneck, J.W., “A General Examination Scheduling System”, Interfaces, 24 (3), 109-120, 1994.
  478. França, P.M., Gendreau, M., Laporte, G., Müller, F.M., “A Composite Heuristic for the Identical Parallel Machine Scheduling Problem with Minimum Makespan Objective”, Computers & Operations Research, 21, 205-210, 1994.
  479. Gaboune, B., Laporte, G., Soumis, F., “An Optimal Tool Partitioning Policy for Numerically Controlled Punch Press Operations”, RAIRO (Recherche opérationnelle), 28, 209-220, 1994.
  480. Laporte, G., Mesa, J.A., Ortega, F A., “Assessing Topological Configurations for Rapid Transit Networks”, Studies in Locational Analysis, 7, 105-121, 1994.
  481. Benati, S., Laporte, G., “Tabu Search Algorithms for the (r | Xp)-Medianoid and the (r| p) -Centroid Problems”, Location Science 2, 193-204, 1994.
  482. ReVelle, C.S., Laporte, G., “New Directions in Plant Location”, Studies in Locational Analysis, 5, 31-58, 1993.
  483. Laporte, G., “Recent Algorithmic Developments for the Traveling Salesman Problem and the Vehicle Routing Problem”, Ricerca Operativa, 23, 5-27, 1993.
  484. Laporte, G., Louveaux, F.V., “The Integer L-Shaped Method for Stochastic Integer Programs with Complete Recourse”, Operations Research Letters, 13, 133-142, 1993.
  485. Fischetti, M., Laporte, G., Martello, S., “The Delivery Man Problem and Cumulative Matroids”, Operations Research, 41, 1055-1064, 1993
  486. Eiselt, H.A., Laporte, G., “Equilibrium Conditions for the 3-Facility Hotelling Model in a Tree”, Transportation Science, 27, 39-43, 1993.
  487. Eiselt, H.A., Laporte, G., Thisse, J.-F, “Competitive Location Models: A Framework and Bibliography”, Transportation Science, 27, 44-54, 1993.
  488. Gaboune, B., Laporte, G., Soumis, F., “Expected Distances between Two Uniformly Distributed Random Points in Rectangles and Rectangular Parallelepipeds”, Journal of the Operational Research Society, 44, 513-519, 1993.
  489. Eiselt, H.A., Gendreau, M., Laporte, G., “Maximizing Pedestrian Flow in Shopping Centre Layout”, Location Science, 1, 187-197, 1993.
  490. Lambert, V., Laporte, G., Louveaux, F.V., “Designing Collections Routes through Bank Branches”, Computers & Operations Research, 20, 783-791, 1993.
  491. Dror, M., Laporte, G., Louveaux, F.V., “Vehicle Routing with Stochastic Demands and Restricted Failures”, Zeitschrift für Operations Research, 37, 273-283, 1993.
  492. Bouzaïene-Ayari, B., Dror, M., Laporte, G., “Vehicle Routing with Stochastic Demands and Split Deliveries”, Foundations of Computing and Decision Sciences, 18, 63-69, 1993.
  493. Gaboune, B., Laporte, G., Soumis, F., “Optimal Strip Sequencing Strategies for Flexible Manufacturing Operations in Two and Three Dimensions”, International Journal of Flexible Manufacturing Systems, 6, 123-135, 1993.
  494. Crainic, T.G., Gendreau, M., Laporte, G., Lardinois, C., “Transport et informatique parallèle”, Les Cahiers Scientifiques du Transport, 26, 77-100, 1992.
  495. Eiselt, H.A., Gendreau, M., Laporte, G., “Tracking Down Elusive Customers”, OR Insight 5, 18-22, 1992.
  496. Gendreau, M., Hertz, A., Laporte, G., “New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem”, Operations Research, 40, 1086-1094, 1992.
  497. Bouliane, J., Laporte, G., “Locating Postal Relay Boxes Using a Set Covering Algorithm”, American Journal of Mathematical and Management Sciences, 12, 65-74, 1992.
  498. Laporte, G., Mercure, H., Nobert, Y., “A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routing Problems”, Journal of the Operational Research Society, 43, 469-481, 1992.
  499. Laporte, G., Louveaux, F.V., Mercure, H., “The Vehicle Routing Problem with Stochastic Travel Times”, Transportation Science, 26, 161-170, 1992.
  500. Berger, I., Bourjolly, J.-M., Laporte, G., “Branch and Bound Algorithms for the Multi-Product Assembly Line Balancing Problem”, European Journal of Operational Research, 58, 215-222, 1992.
  501. Eiselt, H.A., Laporte, G., “The Use of Domains in Multicriteria Decision Making”, European Journal of Operational Research, 61, 292-298, 1992.
  502. Laporte, G., “The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms”, European Journal of Operational Research, 59, 231-247, 1992
  503. Laporte, G., “The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms”, European Journal of Operational Research, 59, 345-358, 1992.
  504. Eiselt, H.A., Gendreau, M., Laporte, G., “Location of Facilities on a Network Subject to a Single Edge Failure”, Networks, 22, 231-246, 1992.
  505. Błażewicz, J., Eiselt, H.A., Finke, G., Laporte, G., Węglarz, J., “Scheduling Tasks and Vehicles in a Flexible Manufacturing System”, International Journal of Flexible Manufacturing Systems, 4, 5-16, 1992.
  506. Błażewicz, J., Finke, G., Laporte, G., Węglarz, J., “Dynamic Programming Algorithm for a FMS Scheduling Problem”, Bulletin of the Polish Academy of Science. Technical Sciences, 39, 345-350, 1991.
  507. Eiselt, H.A., Laporte, G., “Locational Equilibrium of Two Facilities on a Tree”, RAIRO (Recherche opérationnelle), 25, 5-18, 1991..
  508. Eiselt, H,.A., Laporte, G., “A Combinatorial Optimization Problem Arising in Dartboard Design”, Journal of the Operational Research Society, 42, 113-118, 1991.
  509. Desrochers, M., Laporte, G., “Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints”, Operations Research Letters, 10, 27-36, 1991.
  510. Labbé, M., Laporte, G., Mercure, H., “Capacitated Vehicle Routing on Trees”, Operations Research, 39, 616-622, 1991.
  511. Laporte, G., “Développements algorithmiques récents et perspectives de recherche en distributique”, Les Cahiers Scientifiques du Transport, 21, 61-84, 1991.
  512. Laporte, G., Martello, S., “The Selective Travelling Salesman Problem”, Discrete Applied Mathematics, 26, 193-207, 1990.
  513. Błażewicz, J., Laporte, G., “Routing and Scheduling within a Production System Framework”, Foundations of Control Engineering, 14, 53-60, 1989.
  514. Eiselt, H.A., Laporte, G., “Integrated Planning in Distribution Systems”, International Journal of Physical Distribution & Materials Management, 19, 14-19, 1989.
  515. Dror, M., Laporte, G., Trudeau, P., “Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks”, Transportation Science, 23, 166-176, 1989.
  516. Laporte, G., Dejax, P., “Dynamic Location-Routeing Problems”, Journal of the Operational Research Society, 40, 471-482, 1989.
  517. Laporte, G., Chapleau, S., Landry, P.-E., Mercure, H., “An Algorithm for the Design of Mailbox Collection Routes in Urban Areas”, Transportation Research Part B: Methodological, 23, 271-280, 1989.
  518. Eiselt, H.A., Laporte, G., “Competitive Spatial Models”, European Journal of Operational Research, 39, 231-242, 1989.
  519. Eiselt, H.A., Laporte, G., “The Maximum Capture Problem in a Weighted Network”, Journal of Regional Science, 29, 433-439, 1989.
  520. Eiselt, H.A., Laporte, G., Pederzoli, G., “Optimal Sizes of Facilities on a Linear Market”, Mathematical and Computer Modelling, 12, 97-103, 1989.
  521. Laporte, G., “Integer Programming Formulations for the Multi-Depot Vehicle Routing Problem: Comments on a paper by Kulkarni and Bhave”, European Journal of Operational Research, 38, 227, 1989.
  522. Laporte, G., Louveaux, F.V., Mercure, H., “Models and Exact Solutions for a Class of Stochastic Location-Routing Problems”, European Journal of Operational Research, 39, 71-78, 1989.
  523. Laporte, G., “A Survey of Algorithms for Location-Routing Problems”, Investigacion Operativa, 1, 93-123, 1989.
  524. Eiselt, H.A., Laporte, G., “Location of a New Facility on a Linear Market in the Presence of Weights”, Asia-Pacific Journal of Operational Research, 5, 160-165, 1988.
  525. Laporte, G., Nobert, Y., Taillefer, S., “Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems”, Transportation Science, 22, 161-172, 1988.
  526. Eiselt, H.A., Laporte, G., “Trading Areas of Facilities with Different Sizes”, RAIRO (Recherche opérationnelle), 22, 33-44, 1988.
  527. Desrosiers, J., Laporte, G., Sauvé, M., Soumis, F., Taillefer, S., “Vehicle Routing with Full Loads”, Computers & Operations Research, 15, 219-226, 1988.
  528. Laporte, G., Mercure, H., “Balancing Hydraulic Turbine Runners – A Quadratic Assignment Problem”, European Journal of Operational Research, 35, 378-381, 1988.
  529. Eiselt, H.A., Laporte, G., “Combinatorial Optimization Problems with Soft and Hard Requirements”, Journal of the Operational Research Society, 38, 785-795, 1987.
  530. Laporte, G., Taillefer, S., “An Efficient Interchange Procedure for the Archaeological Seriation Problem”, Journal of Archaeological Science, 14, 283-289, 1987.
  531. Laporte, G., Mercure, H., Nobert, Y., “Generalized Travelling Salesman through n Sets of Nodes: The Asymmetrical Case”, Discrete Applied Mathematics, 18, 185‑197, 1987.
  532. Laporte, G., Nobert, Y., Taillefer, S.  “A Branch-and-Bound Algorithm for the Asymmetrical Distance-Constrained Vehicle Routing Problem”, Mathematical Modelling, 9, 857-868, 1987.
  533. Laporte, G., “Solving a Family of Permutation Problem on 0-1 Matrices”, RAIRO (Recherche opérationnelle), 21, 65-85, 1987.
  534. Labbé, M., Laporte, G., “Maximizing User Convenience and Postal Efficiency in Post Box Location”, Belgian Journal of Operations Research, Statistics and Computer Science, 26, 21-35, 1986.
  535. Laporte, G., “Generalized Subtour Elimination Constraints and Connectivity Constraints”, Journal of the Operational Research Society, 37, 509-514, 1986.
  536. Laporte, G., Mercure, H., Nobert, Y., “An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem”, Networks, 16, 33-46, 1986.
  537. Laporte, G., Desroches, S., “The Problem of Assigning Students to Course Sections in a Large Engineering School”, Computers & Operations Research, 13, 387-394, 1986.
  538. Laporte, G., Nobert, Y., Desrochers, M., “Optimal Routing under Capacity and Distance Restrictions”, Operations Research, 33, 1050-1073, 1985.
  539. Laporte, G., Mercure, H., Nobert, Y., “Optimal Tour Planning with Specified Nodes”, RAIRO (Recherche opérationnelle), 18, 203-210, 1985.
  540. Laporte, G., Desrochers, M., Nobert, Y., “Two Exact Algorithms for the Distance Constrained Vehicle Routing Problem”, Networks, 14, 161-172, 1984.
  541. Laporte, G., Desroches, S., “Examination Timetabling by Computer”, Computers & Operations Research, 11, 351-360, 1984.
  542. Laporte, G., Nobert, Y., “Algorithmes de relaxation de contraintes pour le problème du voyageur de commerce symétrique et ses extensions”, Annales des Sciences mathématiques du Québec VII, 109‑137, 1983.
  543. Laporte, G., Nobert, Y., “A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem”, Operations Research Spektrum, 5, 77-85, 1983.
  544. Laporte, G., Nobert, Y., “Generalized Travelling Salesman through n Sets of Nodes: An Integer Programming Approach”, INFOR: Information Systems and Operational Research, 21, 61-75, 1983.
  545. Laporte, G., Nobert, Y., Pelletier, P. , “Hamiltonian Location Problems”, European Journal of Operational Research, 12, 82-89, 1983.
  546. Thalmann, N., Claude, Y., Laporte, G., Rousseau, J.-M. , “ELECT: An Interactive Graphical System for the Automatic Generation of Electoral Maps”, Cartographica, 19, 28-40, 1982.
  547. Miliotis, P., Laporte, G., Nobert, Y., “Computational Comparison of Two Methods for Finding the Shortest Cycle or Circuit in a Graph”, RAIRO (Recherche opérationnelle), 15, 233-239, 1981.
  548. Bourjolly, J.-M., Laporte, G., Rousseau, J.-M., “Découpage électoral automatisé : application à l’Île de Montréal”, INFOR: Information Systems and Operational Research, 19, 113-124, 1981.
  549. Laporte, G., Nobert, Y., “An Exact Algorithm for Minimizing Routing and Operating Costs in Depot Location”, European Journal of Operational Research, 6, 224‑226, 1981.
  550. Laporte, G., Nobert, Y., “A Cutting Planes Algorithm for the m-Salesman Problem”, Journal of the Operational Research Society, 31, 1017-1023, 1980.
  551. Laporte, G., Lefebvre, F., Ouellet, R., “On a Paradox in Elementary Probability Theory”, The Mathematical Gazette, 64, 53-55, 1980.
  552. Laporte, G., Nobert, Y., Biron, J., “Rotating Schedules”, European Journal of Operational Research, 4, 24-30, 1980.
  553. Laporte, G., “The Seriation Problem and the Travelling Salesman Problem”, Journal of Computational and Applied Mathematics, 4, 259-269, 1978.
  554. Desroches, S., Laporte, G., Rousseau, J.-M., “HOREX: A Computer Program for the Construction of Examination Schedules”, INFOR: Information Systems and Operational Research, 16, 294-298, 1978.
  555. Land, A.H., Laporte, G., Miliotis, P., “A Unified Formulation of the Machine Scheduling Problem”, European Journal of Operational Research, 2, 32-35, 1978.
  556. Rousseau, J.-M., Laporte, G., “A Practical Optimisation Technique for a Queueing System”, Operational Research Quarterly, 28, 33-35 1977.
  557. Laporte, G., “A Comparison of Two Norms in Archaeological Seriation”, Journal of Archaeological Science, 3, 249-255, 1976
  558. Adelson, R.M., Norman, J.M., Laporte, G., “A Dynamic Programming Formulation with Diverse Applications”, Operational Research Quarterly, 27, 119-121, 1976.

Forthcoming articles

  1. Rodríguez-Pereira, J., Balçık, B., Laporte, G., Rancourt, M.-È., “Cost Sharing Mechanisms for Multi-Country Partnerships in Disaster Preparedness”, Production and Operations Management.
  2. Rodríguez-Pereira, J., Laporte, G., “The Target Visitation Arc Routing Problem”, TOP.
  3. Laporte, G., Toth, P., “A Gap in Scientific Reporting”, 4OR: A Quarterly Journal of Operations Research.
  4. Rostami, B., Chitsaz, M., Arslan, O., Laporte, G., Lodi, A., “Single Hub Location with Heterogeneous Economies of Scale”, Operations Research.
  5. Wang, S., Qi, J., Laporte, G., “Optimal Subsidy Design for Shore Power Usage in Ship Berthing Operations”, Naval Research Logistics.
  6. Froger, A., Mendoza, J.E., Jabali, O., Laporte, G., “The Electric Vehicle Routing Problem with Capacitated Charging Stations”, Transportation Science.
  7. Moccia, L., Allen, D.W., Laporte, G., Spinosa, A., “Mode Boundaries of Automated Metro and Semi-Rapid Rail in Urban Transit”, Public Transport.
  8. Laporte, G., “Some Contributions of Ailsa H. Land to the Study of The Traveling Salesman Problem”, EURO Journal on Computational Optimization.
  9. Schiffer, M., Boysen, N., Klein, P.S., Laporte, G., Pavone, M., “Optimal Picking Policies in E-Commerce Warehouses”, Management Science.
  10. Wang, S., Qi, J., Laporte, G., “Government Subsidy Plan Modeling and Optimization for Liquefied Natural Gas as Fuel for Maritime Transportation”, Transportation Research Part B: Methodological.
  11. Laporte, G., Rancourt, M.-È., Rodríguez-Pereira, J., Silvestri, S., “Optimizing Access to Drinking Water in Remote Areas. Application to Nepal”, Computers & Operations Research.

Book chapters

  1. Laporte, G., Mesa, J.A., “The Design of Rapid Transit Networks”, Location Science (Second Edition), G. Laporte, S. Nickel and F. Saldanha da Gama (eds.), Springer, Cham, 687-703, 2019.
  2. Laporte, G., Nickel, S., Saldanha da Gama, F., “Introduction to Location Science”, Location Science (Second Edition), G. Laporte, S. Nickel and F. Saldanha da Gama (eds.), Springer, Cham, 1-21, 2019.
  3. 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.
  4. 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.
  5. Laporte, G., Ropke, S., Vidal, T., “Heuristics for the Vehicle Routing Problem”, Vehicle Routing: Problems, Methods and Applications, P. Toth and D. Vigo (eds.), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 87-116, 2014.
  6. Laporte, G., “The Undirected Chinese Postman Problem”, Arc Routing: Problems, Methods and Applications, Á Corberán and G. Laporte (eds.), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 53-64, 2014.
  7. Ghiani, G., Laporte, G., “The Undirected Rural Postman Problem”, Arc Routing: Problems, Methods and Applications, Á Corberán and G. Laporte (eds.), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 85-99, 2014.
  8. Corberán, Á, Laporte, G., “A Historical Perspective on Arc Routing”, Arc Routing: Problems, Methods and Applications, Á Corberán and G. Laporte (eds.), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1-15, 2014.
  9. Louveaux, F.V., Laporte, G., “Stochastic Vehicle Routing Problems”, Encyclopedia of Optimization, Springer, Boston, 3829-3832, 2009.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.
  15. Cordeau, J.-F., Laporte, G., “Tabu Search Heuristics for the Vehicle Routing Problem”, Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee (eds.), Kluwer, Boston, 145-163, 2005.
  16. Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.-S., “New Heuristics for the Vehicle Routing Problem”, A. Langevin and D. Riopel, eds., Logistics Systems: Design and Optimization, Springer, New York, 279-297, 2005.|
  17. 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, 49.1-49.23, 2004.
  18. 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, Paris, 47-70, 2003.
  19. 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, Philadelphia, 109-128, 2002.
  20. 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, Philadelphia, 129-154, 2002.
  21. 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.), Kluwer, Boston, 1-20, 2002.
  22. Laporte, G., “Traveling Salesman Problems and Extensions”, Integer Programming and Network Models, H.A. Eiselt and C.-L. Sandblom (eds.), Springer, Berlin, 315-341, 2000.
  23. Laporte, G., “Arc Routing”, Integer Programming and Network Models, H.A. Eiselt and C.-L. Sandblom (eds.), Springer, Berlin, 343-357, 2000.
  24. Eiselt, H.A., Laporte, G., “A Historical Perspective on Arc Routing”, Arc routing: Theory, Solutions, and Applications, M. Dror (ed.), Kluwer, Boston, 1-16, 2000.
  25. Eiselt, H.A., Laporte, G., “Competitive Location Models”, The Current State of Business Discipline, S.B. Dahiya (ed.), Spellbound Publications, Rohtak, India, 2, 441-464, 2000.
  26. Laporte, G., “Recent Advances in Routing Algorithms”, Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, M. Labbé, G. Laporte, K. Tanczos and P. Toint (eds.), NATO ASI Series F: Computers and Systems Sciences, Vol. 166, Springer, Berlin, 183-202, 1998.
  27. Labbé, M., Laporte, G., Rodriguez-Martín, I., “Path, Tree and Cycle Location”, Fleet Management and Logistics, T.G. Crainic and G. Laporte (eds.), Kluwer, Boston, 187-204, 1998.
  28. Laporte, G., Louveaux, F.V., “Solving Stochastic Routing Problems with the Integer
    L-Shaped Method”, Fleet Management and Logistics, T.G. Crainic and. G. Laporte (eds.), Kluwer, Boston, 159‑167, 1998.
  29. Laporte, G., “Vehicle Routing”, Annotated Bibliographies in Combinatorial Optimization,
    M. Dell’Amico, F. Maffioli, S. Martello (eds.), Wiley, Chichester, 223-240, 1997.
  30. Crainic, T.G., Laporte, G., “Freight Transportation”, Civil and Environmental Engineering Systems: An Advanced Applications Text, A.E. McGarity, C.S. ReVelle (eds.), Wiley, New York, 343-394, 1997.
  31. Gendreau, M., Laporte, G., Potvin, J.-Y., “Local Search Algorithms for the Vehicle Routing Problem”, Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra (eds.), Wiley, Chichester, 311-336, 1997.
  32. Bourjolly, J.-M., Gill, P., Laporte, G., Mercure, H., “An Exact Quadratic 0-1 Algorithm for the Stable Set Problem”, Cliques, Coloring and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science 26, D.S. Johnson and M.A. Trick (eds.), American Mathematical Society, Providence, 53-73, 1996.
  33. Eiselt, H.A., Laporte, G., “Objectives in Location Problems”, Facility Location: A Survey of Methodology and Applications, Z. Drezner (ed.), Springer-Verlag, New York, 151-180, 1995.
  34. Laporte, G., Louveaux, F.V., “Formulations and Bounds for the Stochastic Vehicle Routing Problem with Uncertain Supplies”, Economic Decision-Making: Games, Econometrics and Optimization,  J.J. Gabszewicz, J.-F. Richard and L.A. Wolsey (eds.), North-Holland, Amsterdam, 443-455, 1991.
  35. Laporte, G., “Location-Routing Problems”, Vehicle Routing: Methods and Studies, B.L. Golden and A.A. Assad (eds.), North-Holland, Amsterdam, 163-198, 1988.
  36. Laporte, G., Nobert, Y., “Exact Algorithms for the Vehicle Routing Problem”, Surveys in Combinatorial Optimization, S. Martello, G. Laporte, M. Minoux and C.C. Ribeiro (eds.), North-Holland, Amsterdam, 147-184, 1987.
  37. Laporte, G., Nobert, Y., Arpin, D., “An Exact Algorithm for Solving a Capacitated Location-Routing Problem”, Location Theory: Methodology and Applications, Baltzer, Basel, Switzerland, 293-310, 1986.
  38. Laporte, G., Rousseau, J.-M., Thalmann, N.,  “La conception automatique de cartes électorales”, Applications du graphisme par ordinateur, G. Laporte and N. Thalmann (eds.), Gaëtan Morin, Chicoutimi, 97-108, 1984.

Articles published in refereed proceedings

  1. Zufferey, N., Coindreau, M.-A., Gallay, O., Laporte, G., “Workload Balancing at Cross-Docking Platforms”, Proceedings of the International Conference on Optimization and Decision Science (ODS2021), Rome, 2021.
  2. Ghiami, Y., Van Woensel, T., Christiansen, M., Laporte, G., “A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem”, Computational Logistics, Proceedings of the 6th International Conference, ICCL 2015, Lecture Notes in Computer Science, Springer, Cham, Switzerland, 91-104, 2015.
  3. 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.
  4. Salazar-Aguilar M.A., Langevin A., Laporte, G., “An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes”, Lecture Notes in Computer Science, J. Pahl, T. Reimer, S. Voss (eds.)., Berlin, 6701, 406-411, 2011.
  5. Laporte, G., Marin, Á., 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.
  6. Ortega, F.A., Laporte, G., Mesa, J.A., “Generación de Alineamientos 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. Zaragoza, Spain, 703-710 2004.
  7. Laporte, G., “La confection automatique des cartes électorales”, Présentations à la Société royale du Canada, Académie des lettres et des sciences humaines 51, 42-50, 2000.
  8. Laporte, G., Gendreau, M., Potvin, J.-Y., Semet, F., “Classical and Modern Heuristics for the Vehicle Routing Problem”, Operations Research – From Theory to Real Life, E. Kozan (ed.), Gold Coast, Australia, 1-16, 1999.
  9. Laporte, G., “Exact Algorithms for the Traveling Salesman Problem and the Vehicle Routing Problem”, Progress in Industrial Mathematics at ECMI98, L. Arkeryd, J. Bergh, P. Brenner, R. Pettersson (eds.), B.G. Teubner, Stuttgart, Leipzig, 458-472, 1999.
  10. Laporte, G., Mesa, J.A., Ortega, F.A., “Aspectos Metodológicos para la Selection de Ubicaciones de Estaciones de Metro”, Actas del III Congreso de Ingenieria del Transporte A. López Pita and F. Robusté Antón (eds.), CIMNE, Barcelona, 245-252, 1999.
  11. Laporte, G., “Recent Advances in Routing Algorithms”, Proceedings, NOAS’97, C.C. Carøe and D. Pisinger (eds.), DIKU, Copenhagen, 179-206, 1997.
  12. Eiselt, H.A., Gendreau, M., Laporte, G., “Operations Research Approaches to Shopping Center Planning”, Proceedings of the Administrative Sciences Association of Canada (Management Science) 18, 1996.
  13. Carter, M.W., Laporte, G., Chinneck, J.W., “An Introduction to Examine: A Flexible Examination Scheduling System”, Conference Paper. Selected Sessions of the 1993 AACRAO Annual Meeting, American Association of Collegiate Registrars and Admission Officers, 223-234, 1993.
  14. Farvolden, J.M., Laporte, G., Xu, J., “Solving an Inventory Allocation and Routing Problem Arising in Grocery Distribution”, Proceedings of the Administrative Sciences Association of Canada (Management Science) 14, 34-43, 1993.
  15. Gendreau, M., Hertz, A., Laporte, G., “A Tabu Search Heuristic for the Vehicle Routing Problem”, Proceedings of the ’92 International Conference on Urban Land Use and Transport Systems ICULTS ’92, 56-90, 1993.
  16. Eiselt, H.A., Gendreau, M., Laporte, G., “The Optimal Location of Stores in a Shopping Mall”, J.A. Moreno-Pérez (ed.), Proceedings of the VI Meeting of the EURO Working Group on Locational Analysis, Puerto de La Cruz, Tenerife, 61-68, 1992.
  17. Eiselt, H.A., Langley, A., Laporte, G., “Domain Criteria in Decision Problems”, Proceedings of the XXth Annual Meeting of the South East Region of the Decision Sciences Institute, 239-243, 1990.
  18. Laporte, G., Mercure, H., Nobert, Y., “Cutting Planes Based on Bin Packing Solutions for the Capacitated Vehicle Routing Problem”, Congressus Numerantium 59, 165-178, 1988.
  19. Laporte, G., Nobert, Y., “A Vehicle Flow Model for the Optimal Design of a Two-Echelon Distribution Model”, Advances in Optimization and Control, H.A. Eiselt and G. Pederzoli (eds.), Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 158-173, 1988..
  20. Laporte, G., Chapleau, S., Landry, P.-É., Mercure, H., “Improving Efficiency through Better Routing at Canada Post”, Comptes rendus du Congrès de l’Association des sciences administratives du Canada (Recherche opérationnelle) 8, 159‑168, 1987.
  21. Laporte, G., Nobert, Y., Trinh, K.N., “An Optimal Flow Circulation Algorithm for the Asymmetrical Multiple Travelling Salesman Problem”, Congressus Numerantium 57, 235-248, 1987.
  22. Laporte, G., Mercure, H., Nobert, Y., “Finding the Shortest Hamiltonian Circuit through n Clusters: A Langrangean Relaxation Approach”, Congressus Numerantium 48, 277-290, 1985.
  23. Laporte, G., “Dealing with Fuzziness in Some Highly Structured Combinatorial Problems”, Comptes rendus du Congrès de l’Association des sciences administratives du Canada (Recherche opérationnelle) 6, 97-101, 1985.
  24. Laporte, G., Nobert, Y., Arpin, D., “Optimal Solutions to Capacitated Multi-depot Vehicle Routing Problems”, Congressus Numerantium 44, 283-292, 1984.
  25. Laporte, G., Mercure, H., Nobert, Y., “Networks Models and Algorithms for Three Types of Vehicle Routing Problems”, Proceedings of the Fifth International Symposium on Network Theory, 326-330, 1984.
  26. Laporte, G., Nobert, Y.  “Comb Inequalities for the Vehicle Routing Problem”, Methods of Operations Research 51, 271-276, 1984.
  27. Laporte, G., Nobert, Y., “Finding the Shortest Cycle through k Specified Nodes”, Congressus Numerantium 40, 155-167, 1983.
  28. Laporte, G., Rousseau, J.-M., Thalmann, N., “A Multicriteria Approach to Social and Political Districting”, Comptes rendus du Congrès de l’Association des sciences administratives du Canada (Recherche opérationnelle) 4, 1-8, 1983.
  29. Laporte, G., Nobert, Y., Pelletier, P., “Transformation of the Multiple Travelling Salesman Problem into a Single Travelling Salesman Problem”, Comptes rendus du congrès de l’Association des sciences administratives du Canada (Recherche opérationnelle) 2, 37-44, 1981.
  30. Laporte, G., Mercure, H., Nobert, Y., “The Multi-Depot m-Salesman Problem”, Methods of Operations Research, Oelgeschlager, Gunn & Hain Publishers, Cambridge, Massachusetts, 367-370, 1981.
  31. Laporte, G., “Work Schedules for Police and Fire Departments”, Comptes rendus du congrès de l’Association des sciences administratives du Canada (Gestion des opérations), 35-42, 1978.

Articles published in professional journals

  1. Laporte, G., “Supply Chain Management in Liege and Montreal”, Spirit of Management 8, 44, 2010.
  2. Breton, M., Dupuis, D.J., Laporte, G., “Cent ans d’histoire en méthodes quantitatives”, Gestion 32(3), 12-20, 2007.
  3. Cordeau, J.-F., Laporte, G., “Le transport des marchandises en quelques chiffres”, Routes et Transports 25, 43-44, 1996.
  4. Laporte, G., Roy, J., “Les modèles de localisation commerciale sont-ils utilisés en pratique ?”, Gestion 4, 54-60, 1979.
  5. Laporte, G., Nobert, Y., “Distribution à partir d’un entrepôt central : le logiciel CIRCUITS”, Gestion 3, 53-58, 1978. (Reprinted in Revue française de gestion 19, 90-93, 1979.)
  6. Biron, J., Laporte, G., “La construction d’horaires de travail pour certains employés du secteur public”, Revue statistique du Québec XVI, 19-24, 1978.
  7. Laporte, G., Nobert, Y., “La construction d’horaires rotatifs pour des entreprises à feu continu”, Gestion 2, 61-68, 1977.

 Submitted articles

  1. Santos, A., Fagerholt, K., Laporte, G., Guedes Soares, C., “Solving the Supply Vessel Planning Problem under Uncertain Demand by Two-Stage Stochastic Programming with Recourse”, Transportation Research Part B: Methodological.
  2. Wøhlk, S., Laporte, G., “Transport of Skips between Recycling Centers and Treatment Facilities”, Computers & Operations Research.
  3. Darvish, M., Coelho, L.C., Laporte, G, “The Dynamic Routing Problem with Due Dates and Stochastic Release Dates”, European Journal of Operational Research.
  4. Thomasson, O., Battarra, M., Erdoğan, G., Laporte, G., “Pallet Location and Job Scheduling in a Twin-Robot System”, Computers & Operations Research.
  5. Zbib, H., Balçık, B., Rancourt, M.-È., Laporte, G., “A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves”, Operations Research.
  6. Özarık, S.S., Lurkin, V., Veelenturf, L.P, Van Woensel, T., Laporte, G., “Last-Mile Deliveries with Multiple Visits under Uncertain Customer Availability”, European Journal of Operational Research.
  7. Barrena, E., Canca, D., Coelho, L.C., Laporte, G., “The Selective Traveling Salesman Problem with Time-Dependent Profits”, TOP.
  8. Xiao, L., Zhen, L., Laporte, G., Baldacci, R., Wang, C., “A Column Generation-Based Heuristic for a Rehabilitation Patient Scheduling and Routing Problem”, Computers & Operations Research.
  9. Wu, Y., Wang, S., Zhen, L., Laporte, G., “Integrating Operations Research into Green Logistics: A Review”, Computers & Industrial Engineering.
  10. Zhen, L., He, X., Wang, H., Laporte, G., Tan, Z., “Model-Driven Personal Shopper Platform Management”, European Journal of Operational Research.
  11. Haghi, M., Arslan, O., Laporte, G., “A Location-or-Routing Problem with Partial and Decaying Coverage”, Computers & Operations Research.

%d bloggers like this: