Gilbert Laporte

442 papers C 6Journal 424Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows.
Comput. Oper. Res.
Slim Belhaiza, Gilbert Laporte
2026 J jnl
Decarbonizing road freight transportation: recent advances and future trends.
J. Oper. Res. Soc.
Çagri Koç, Tolga Bektas, Gilbert Laporte
2026 J jnl
Multi-output shrunken regression trees.
Eur. J. Oper. Res.
Xuecheng Tian, Shuaian Wang, Gilbert Laporte
2026 J jnl
Optimizing the assignment decisions in the refugee resettlement process.
Int. Trans. Oper. Res.
Jésica de Armas, Valérie Bélanger, Gilbert Laporte, Marie-Ève Rancourt
2025 J jnl
50 years of Computers & Operations Research: A bibliometric analysis.
Comput. Oper. Res.
Li Guan, Gilbert Laporte, José M. Merigó, Stefan Nickel, Iman Rahimi, Francisco Saldanha-da-Gama
2025 J jnl
A Heteroscedastic Robust Bayesian Optimization Method for Solving Simulation-Based Transportation Problems.
Transp. Sci.
Jinbiao Huo, Ziyuan Gu, Zhiyuan Liu, Shuaian Wang, Gilbert Laporte
2025 J jnl
A unifying framework for selective routing problems.
Eur. J. Oper. Res.
Cagla F. Dursunoglu, Okan Arslan, Sebnem Manolya Demir, Bahar Yetis Kara, Gilbert Laporte
2025 J jnl
Learning for routing: A guided review of recent developments and future directions.
CoRR
Fangting Zhou, Attila Lischka, Balázs Kulcsár, Jiaming Wu, Morteza Haghir Chehreghani, Gilbert Laporte
2025 J jnl
Operational research on dengue: critical review and research agenda.
J. Oper. Res. Soc.
Laura Silva de Assis, Fábio Luiz Usberti, Emrah Demir, Celso Cavellucci, Gilbert Laporte
2025 J jnl
Optimizing an On-Demand Delivery Mode Based on Trucks and Drones.
Transp. Sci.
Lu Zhen, Jiajing Gao, Shuaian Wang, Gilbert Laporte, Xiaohang Yue
2025 J jnl
Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services.
Comput. Oper. Res.
Ziru Lin, Xiaofeng Xu, Emrah Demir, Gilbert Laporte
2025 J jnl
Sustainable risk mitigation in hazardous material transportation.
Comput. Oper. Res.
Annarita De Maio, Gilbert Laporte, Roberto Musmanno, Francesca Vocaturo
2025 J jnl
The integrated planning of berth allocation, quay crane assignment, and pilotage scheduling.
Comput. Oper. Res.
Liyang Xiao, Gilbert Laporte, Peng Sun, Wei Xie
2024 J jnl
A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves.
Oper. Res.
Hani Zbib, Burcu Balcik, Marie-Ève Rancourt, Gilbert Laporte
2024 J jnl
Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem.
Comput. Oper. Res.
David Canca, Eva Barrena, Gilbert Laporte
2024 J jnl
Determinism versus uncertainty: Examining the worst-case expected performance of data-driven policies.
Eur. J. Oper. Res.
Xuecheng Tian, Shuaian Wang, Gilbert Laporte, Ying Yang
2024 J jnl
Fifty years of operational research: 1972-2022.
Eur. J. Oper. Res.
Gilbert Laporte
2024 J jnl
Network design with vulnerability constraints and probabilistic edge reliability.
Networks
Okan Arslan, Gilbert Laporte
2024 J jnl
Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms.
Comput. Oper. Res.
Pedram Beldar, Maria Battarra, Gilbert Laporte
2024 J jnl
Operational Research: methods and applications.
J. Oper. Res. Soc.
Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
2024 J jnl
Stability metrics for a maritime inventory routing problem under sailing time uncertainty.
EURO J. Transp. Logist.
Homayoun Shaabani, Lars Magnus Hvattum, Gilbert Laporte, Arild Hoff
2024 J jnl
Strategic flood impact mitigation in developing countries' urban road networks: Application to Hanoi.
Eur. J. Oper. Res.
Siao-Leu Phouratsamay, Maria Paola Scaparra, Trung Hieu Tran, Gilbert Laporte
2024 J jnl
The Impact of Partial Production Capacity Sharing via Production as a Service.
Comput. Oper. Res.
Christina Johanna Liepold, Okan Arslan, Gilbert Laporte, Maximilian Schiffer
2024 J jnl
Vehicle routing with stochastic demand, service and waiting times - The case of food bank collection problems.
Eur. J. Oper. Res.
Meike Reusken, Gilbert Laporte, Sonja U. K. Rohmer, Frans Cruijssen
2023 J jnl
A location-or-routing problem with partial and decaying coverage.
Comput. Oper. Res.
Maryam Haghi, Okan Arslan, Gilbert Laporte
2023 J jnl
A matheuristic for the multi-product maritime inventory routing problem.
Comput. Oper. Res.
Homayoun Shaabani, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte
2023 J jnl
Heterogeneous instant delivery orders scheduling and routing problem.
Comput. Oper. Res.
Lu Zhen, Jingwen Wu, Gilbert Laporte, Zheyi Tan
2023 J jnl
Making opportunity sales in attended home delivery.
Comput. Oper. Res.
Çelen Naz Ötken, Baris Yildiz, Okan Arslan, Gilbert Laporte
2023 J jnl
Territorial design for customers with demand frequency.
Eur. J. Oper. Res.
Lu Zhen, Jiajing Gao, Zheyi Tan, Gilbert Laporte, Roberto Baldacci
2022 J jnl
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem.
Comput. Oper. Res.
Liyang Xiao, Lu Zhen, Gilbert Laporte, Roberto Baldacci, Chenghao Wang
2022 J jnl
A gap in scientific reporting.
4OR
Gilbert Laporte, Paolo Toth
2022 J jnl
Minimum cost delivery of multi-item orders in e-commerce logistics.
Comput. Oper. Res.
M. Hakan Akyüz, Ibrahim Muter, Günes Erdogan, Gilbert Laporte
2022 J jnl
Mode boundaries of automated metro and semi-rapid rail in urban transit.
Public Transp.
Luigi Moccia, Duncan W. Allen, Gilbert Laporte, Andrea Spinosa
2022 J jnl
Optimal Picking Policies in E-Commerce Warehouses.
Manag. Sci.
Maximilian Schiffer, Nils Boysen, Patrick S. Klein, Gilbert Laporte, Marco Pavone
2022 J jnl
Optimizing access to drinking water in remote areas. Application to Nepal.
Comput. Oper. Res.
Gilbert Laporte, Marie-Ève Rancourt, Jessica Rodríguez-Pereira, Selene Silvestri
2022 J jnl
Pallet location and job scheduling in a Twin-Robot system.
Comput. Oper. Res.
Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte
2022 J jnl
Single Allocation Hub Location with Heterogeneous Economies of Scale.
Oper. Res.
Borzou Rostami, Masoud Chitsaz, Okan Arslan, Gilbert Laporte, Andrea Lodi
2022 J jnl
Solving real-size stochastic railway rapid transit network construction scheduling problems.
Comput. Oper. Res.
David Canca, Gilbert Laporte
2022 J jnl
The Electric Vehicle Routing Problem with Capacitated Charging Stations.
Transp. Sci.
Aurélien Froger, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte
2022 J jnl
Transport of skips between recycling centers and treatment facilities.
Comput. Oper. Res.
Sanne Wøhlk, Gilbert Laporte
2021 J jnl
A dynamic multi-period general routing problem arising in postal service and parcel delivery systems.
Comput. Oper. Res.
Demetrio Laganà, Gilbert Laporte, Francesca Vocaturo
2021 J jnl
A scalable dynamic parking allocation framework.
Comput. Oper. Res.
Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut
2021 J jnl
A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations.
Comput. Oper. Res.
Merve Keskin, Bülent Çatay, Gilbert Laporte
2021 J jnl
Algorithms for the Calzedonia workload allocation problem.
J. Oper. Res. Soc.
Maria Battarra, Federico Fraboni, Oliver Thomasson, Günes Erdogan, Gilbert Laporte, Marco Formentini
2021 J jnl
Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions.
Eur. J. Oper. Res.
Bruno Salezza Vieira, Glaydston Mattos Ribeiro, Laura Bahiense, Roberto Edward Cruz, André Bergsten Mendes, Gilbert Laporte
2021 J jnl
Inbound and outbound flow integration for cross-docking operations.
Eur. J. Oper. Res.
Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte
2021 J jnl
Integrated planning for electric commercial vehicle fleets: A case study for retail mid-haul logistics networks.
Eur. J. Oper. Res.
Maximilian Schiffer, Patrick S. Klein, Gilbert Laporte, Grit Walther
2021 J jnl
Periodic supply vessel planning under demand and weather uncertainty.
INFOR Inf. Syst. Oper. Res.
Yauheni Kisialiou, Irina V. Gribkovskaia, Gilbert Laporte
2021 J jnl
Reorganizing postal collection operations in urban areas as a result of declining mail volumes - A case study in Bologna.
J. Oper. Res. Soc.
Giuseppe Bruno, Manuel Cavola, Antonio Diglio, Gilbert Laporte, Carmela Piccolo
2021 J jnl
Solving a Real-World Urban Postal Service System Redesign Problem.
Sci. Program.
Hao Yu, Xu Sun, Wei Deng Solvang, Gilbert Laporte
2021 J jnl
Some contributions of Ailsa H. Land to the study of the traveling salesman problem.
EURO J. Comput. Optim.
Gilbert Laporte
2020 J jnl
A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints.
INFORMS J. Comput.
Okan Arslan, Ola Jabali, Gilbert Laporte
2020 J jnl
A concise guide to existing and emerging vehicle routing problem variants.
Eur. J. Oper. Res.
Thibaut Vidal, Gilbert Laporte, Piotr Matl
2020 J jnl
A review of vehicle routing with simultaneous pickup and delivery.
Comput. Oper. Res.
Çagri Koç, Gilbert Laporte, Ilknur Tükenmez
2020 J jnl
A spatially disaggregated model for the technology selection and design of a transit line.
Public Transp.
Luigi Moccia, Duncan W. Allen, Gilbert Laporte
2020 J jnl
Crowd-shipping with time windows and transshipment nodes.
Comput. Oper. Res.
Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte
2020 J jnl
The commodity-split multi-compartment capacitated arc routing problem.
Comput. Oper. Res.
Hani Zbib, Gilbert Laporte
2020 J jnl
The parking allocation problem for connected vehicles.
J. Heuristics
Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut
2019 J jnl
A concise guide to existing and emerging vehicle routing problem variants.
CoRR
Thibaut Vidal, Gilbert Laporte, Piotr Matl
2019 J jnl
A districting-based heuristic for the coordinated capacitated arc routing problem.
Comput. Oper. Res.
Sanne Wøhlk, Gilbert Laporte
2019 J jnl
A two-echelon inventory routing problem for perishable products.
Comput. Oper. Res.
Sonja U. K. Rohmer, G. D. H. Claassen, Gilbert Laporte
2019 J jnl
A vehicle routing problem arising in unmanned aerial monitoring.
Comput. Oper. Res.
Lu Zhen, Miao Li, Gilbert Laporte, Wencheng Wang
2019 J jnl
An Exact Algorithm for Multilevel Uncapacitated Facility Location.
Transp. Sci.
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
2019 J jnl
An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows.
Eur. J. Oper. Res.
Giusy Macrina, Gilbert Laporte, Francesca Guerriero, Luigi Di Puglia Pugliese
2019 J jnl
Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle.
CoRR
Leandro C. Coelho, Gilbert Laporte, Arinei Lindbeck, Thibaut Vidal
2019 J jnl
Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations.
Comput. Oper. Res.
Merve Keskin, Gilbert Laporte, Bülent Çatay
2019 J jnl
Exact Solution of Several Families of Location-Arc Routing Problems.
Transp. Sci.
Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira
2019 J jnl
Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions.
Comput. Oper. Res.
Aurélien Froger, Jorge E. Mendoza, Ola Jabali, Gilbert Laporte
2019 J jnl
Integrated planning of ship deployment, service schedule and container routing.
Comput. Oper. Res.
Lu Zhen, Shuaian Wang, Gilbert Laporte, Yi Hu
2019 J jnl
Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer.
Comput. Oper. Res.
Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte
2019 J jnl
Median and covering location problems with interconnected facilities.
Comput. Oper. Res.
Marilène Cherkesly, Mercedes Landete, Gilbert Laporte
2019 J jnl
The Steiner Traveling Salesman Problem and its extensions.
Eur. J. Oper. Res.
Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora
2019 J jnl
The electric vehicle routing problem with shared charging stations.
Int. Trans. Oper. Res.
Çagri Koç, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte
2019 J jnl
The green mixed fleet vehicle routing problem with partial battery recharging and time windows.
Comput. Oper. Res.
Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte
2019 J jnl
The railway rapid transit network construction scheduling problem.
Comput. Ind. Eng.
David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa
2019 J jnl
Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows.
J. Heuristics
Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim, Gilbert Laporte
2019 J jnl
Vehicle Routing and Location Routing with Intermediate Stops: A Review.
Transp. Sci.
Maximilian Schiffer, Michael Schneider, Grit Walther, Gilbert Laporte
2018 J jnl
A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem.
Transp. Sci.
Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira
2018 J jnl
A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem.
Transp. Sci.
Anna Franceschetti, Dorothée Honhon, Gilbert Laporte, Tom Van Woensel
2018 J jnl
A fast heuristic for large-scale capacitated arc routing problems.
J. Oper. Res. Soc.
Sanne Wøhlk, Gilbert Laporte
2018 J jnl
An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling.
Comput. Oper. Res.
Lei He, Xiao-Lu Liu, Gilbert Laporte, Yingwu Chen, Yingguo Chen
2018 J jnl
Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem.
Transp. Sci.
Kai Wang, Lu Zhen, Shuaian Wang, Gilbert Laporte
2018 J jnl
Corridor-based metro network design with travel flow capture.
Comput. Oper. Res.
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov
2018 J jnl
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities.
Eur. J. Oper. Res.
Maximilian Schiffer, Michael Schneider, Gilbert Laporte
2018 J jnl
Exact Solution of the Evasive Flow Capturing Problem.
Oper. Res.
Okan Arslan, Ola Jabali, Gilbert Laporte
2018 J jnl
Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times.
Eur. J. Oper. Res.
Vitor Nesello, Anand Subramanian, Maria Battarra, Gilbert Laporte
2018 J jnl
Long-haul vehicle routing and scheduling with idling options.
J. Oper. Res. Soc.
Çagri Koç, Ola Jabali, Gilbert Laporte
2018 J jnl
Multi-level facility location problems.
Eur. J. Oper. Res.
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
2018 J jnl
Route and speed optimization for autonomous trucks.
Comput. Oper. Res.
Moncef Ilies Nasri, Tolga Bektas, Gilbert Laporte
2018 J jnl
Scheduling twin robots in a palletising problem.
Int. J. Prod. Res.
Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte
2018 J jnl
Shared mobility systems: an updated survey.
Ann. Oper. Res.
Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
2018 J jnl
The Chinese Postman Problem with Load-Dependent Costs.
Transp. Sci.
Ángel Corberán, Günes Erdogan, Gilbert Laporte, Isaac Plana, José M. Sanchis
2018 J jnl
The periodic supply vessel planning problem with flexible departure times and coupled vessels.
Comput. Oper. Res.
Yauheni Kisialiou, Irina Gribkovskaia Sr., Gilbert Laporte
2018 J jnl
The static bike relocation problem with multiple vehicles and visits.
Eur. J. Oper. Res.
Teobaldo L. Bulhões Júnior, Anand Subramanian, Günes Erdogan, Gilbert Laporte
2018 J jnl
Vehicle routing with backhauls: Review and research perspectives.
Comput. Oper. Res.
Çagri Koç, Gilbert Laporte
2017 J jnl
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem.
Comput. Oper. Res.
Selene Silvestri, Gilbert Laporte, Raffaele Cerulli
2017 J jnl
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints.
Comput. Oper. Res.
Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin
2017 J jnl
A metaheuristic for the time-dependent pollution-routing problem.
Eur. J. Oper. Res.
Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom Van Woensel, Gilbert Laporte, Mark Stobbe
2017 J jnl
An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time.
Comput. Oper. Res.
Xiao-Lu Liu, Gilbert Laporte, Yingwu Chen, Renjie He
2017 J jnl
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem.
Comput. Oper. Res.
David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa
2017 J jnl
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs.
Comput. Oper. Res.
Sanne Wøhlk, Gilbert Laporte
2017 J jnl
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location.
INFORMS J. Comput.
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
2017 J jnl
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile.
Comput. Oper. Res.
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia
2017 J jnl
Planning a selective delivery schedule through Adaptive Large Neighborhood Search.
Comput. Ind. Eng.
Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte
2017 J jnl
Resource constrained routing and scheduling: Review and research prospects.
Eur. J. Oper. Res.
Dimitris C. Paraskevopoulos, Gilbert Laporte, Panagiotis P. Repoussis, Christos D. Tarantilis
2017 J jnl
Scheduling identical parallel machines with tooling constraints.
Eur. J. Oper. Res.
Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse
2017 J jnl
The multi-vehicle cumulative covering tour problem.
Ann. Oper. Res.
David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte
2017 J jnl
The pickup and delivery problem with time windows and handling operations.
Comput. Oper. Res.
Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
2017 J jnl
The railway line frequency and size setting problem.
Public Transp.
Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea
2017 J jnl
Vehicle routing with cross-dock selection.
Comput. Oper. Res.
Yousef Maknoon, Gilbert Laporte
2017 J jnl
Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms.
Comput. Oper. Res.
Eirik Fernández Cuesta, Henrik Andersson, Kjetil Fagerholt, Gilbert Laporte
2016 J jnl
50th Anniversary Invited Article - Goods Distribution with Electric Vehicles: Review and Research Perspectives.
Transp. Sci.
Samuel Pelletier, Ola Jabali, Gilbert Laporte
2016 J jnl
A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem.
Comput. Oper. Res.
Karine Sinclair, Jean-François Cordeau, Gilbert Laporte
2016 J jnl
A general rapid network design, line planning and fleet investment integrated model.
Ann. Oper. Res.
David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa
2016 J jnl
A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand.
Comput. Oper. Res.
Alper Ekrem Murat, Gilbert Laporte, Vedat Verter
2016 J jnl
A short-turning policy for the management of demand disruptions in rapid transit systems.
Ann. Oper. Res.
David Canca, Eva Barrena, Gilbert Laporte, Francisco A. Ortega
2016 J jnl
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines.
Transp. Sci.
Roel G. van Anholt, Leandro C. Coelho, Gilbert Laporte, Iris F. A. Vis
2016 J jnl
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem.
Comput. Oper. Res.
Geraldo Regis Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena, Gilbert Laporte
2016 J jnl
An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem.
Eur. J. Oper. Res.
Ahmad Hemmati, Lars Magnus Hvattum, Marielle Christiansen, Gilbert Laporte
2016 J jnl
Berth allocation in an ore terminal with demurrage, despatch and maintenance.
Comput. Ind. Eng.
Glaydston Mattos Ribeiro, Geraldo Regis Mauri, Saulo de Castro Beluco, Luiz Antonio Nogueira Lorena, Gilbert Laporte
2016 J jnl
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.
Eur. J. Oper. Res.
Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte
2016 J jnl
Counting and enumerating feasible rotating schedules by means of Gröbner bases.
Math. Comput. Simul.
Raúl M. Falcón, Eva Barrena, David Canca, Gilbert Laporte
2016 J jnl
Exact and heuristic algorithms for the Hamiltonian p-median problem.
Eur. J. Oper. Res.
Günes Erdogan, Gilbert Laporte, Antonio M. Rodríguez-Chía
2016 J jnl
Large neighborhood search for multi-trip vehicle routing.
Eur. J. Oper. Res.
François V. Louveaux, Yasemin Arda, Yves Crama, Gilbert Laporte
2016 J jnl
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015.
INFOR Inf. Syst. Oper. Res.
Leandro C. Coelho, Jacques Renaud, Gilbert Laporte
2016 J jnl
Scheduling issues in vehicle routing.
Ann. Oper. Res.
Gilbert Laporte
2016 J jnl
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm.
Comput. Oper. Res.
Hongtao Lei, Rui Wang, Gilbert Laporte
2016 J jnl
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty.
Manag. Sci.
Oguz Solyali, Jean-François Cordeau, Gilbert Laporte
2016 J jnl
The Rainbow Cycle Cover Problem.
Networks
Selene Silvestri, Gilbert Laporte, Raffaele Cerulli
2016 J jnl
The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm.
Eur. J. Oper. Res.
Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte
2016 J jnl
The traveling salesman problem with time-dependent service times.
Eur. J. Oper. Res.
Duygu Tas, Michel Gendreau, Ola Jabali, Gilbert Laporte
2016 J jnl
Thirty years of heterogeneous vehicle routing.
Eur. J. Oper. Res.
Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte
2015 — conf
A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem.
ICCL
Yousef Ghiami, Tom Van Woensel, Marielle Christiansen, Gilbert Laporte
2015 C conf
A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper).
ATMOS
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia
2015 J jnl
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows.
Comput. Oper. Res.
Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte
2015 J jnl
A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading.
Comput. Oper. Res.
Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
2015 J jnl
ASP, The Art and Science of Practice: Academia-Industry Interfacing in Operations Research in Montréal.
Interfaces
Laure Cabantous, Gilbert Laporte
2015 J jnl
Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading.
Transp. Sci.
Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte
2015 J jnl
Classification, models and exact algorithms for multi-compartment delivery problems.
Eur. J. Oper. Res.
Leandro C. Coelho, Gilbert Laporte
2015 J jnl
Dynamic design of sales territories.
Comput. Oper. Res.
Hongtao Lei, Gilbert Laporte, Yajie Liu, Tao Zhang
2015 J jnl
Integrated vehicle routing problems.
Comput. Oper. Res.
Tolga Bektas, Gilbert Laporte, Daniele Vigo
2015 J jnl
Model-based automatic neighborhood design by unsupervised learning.
Comput. Oper. Res.
Gianpaolo Ghiani, Gilbert Laporte, Emanuele Manni
2015 J jnl
Multi-level facility location as the maximization of a submodular set function.
Eur. J. Oper. Res.
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
2015 J jnl
Path based algorithms for metro network design.
Comput. Oper. Res.
Gilbert Laporte, Marta M. B. Pascoal
2015 J jnl
Robust assembly line balancing with heterogeneous workers.
Comput. Ind. Eng.
Mayron César O. Moreira, Jean-François Cordeau, Alysson M. Costa, Gilbert Laporte
2015 J jnl
Scheduling Twin Yard Cranes in a Container Block.
Transp. Sci.
Amir Hossein Gharehgozli, Gilbert Laporte, Yugang Yu, René M. B. M. de Koster
2015 J jnl
Shared mobility systems.
4OR
Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
2015 J jnl
Tactical network planning for food aid distribution in Kenya.
Comput. Oper. Res.
Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte, Ben Watkins
2015 J jnl
The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations.
Discret. Appl. Math.
Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte
2015 J jnl
Transferability of collective transportation line networks from a topological and passenger demand perspective.
Networks Heterog. Media
Eva Barrena, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa
2014 J jnl
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes.
Transp. Sci.
Ibrahim Muter, Jean-François Cordeau, Gilbert Laporte
2014 J jnl
A comparison of several enumerative algorithms for Sudoku.
J. Oper. Res. Soc.
Leandro C. Coelho, Gilbert Laporte
2014 J jnl
A comparison of several models for the hamiltonian
Networks
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski
2014 J jnl
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.
Comput. Oper. Res.
Slim Belhaiza, Pierre Hansen, Gilbert Laporte
2014 J jnl
A review of recent research on green road freight transportation.
Eur. J. Oper. Res.
Emrah Demir, Tolga Bektas, Gilbert Laporte
2014 J jnl
Districting for Arc Routing.
INFORMS J. Comput.
Alexander Butsch, Jörg Kalcsics, Gilbert Laporte
2014 J jnl
Exact formulations and algorithm for the train timetabling problem with dynamic demand.
Comput. Oper. Res.
Eva Barrena, David Canca, Leandro C. Coelho, Gilbert Laporte
2014 J jnl
Heuristics for dynamic and stochastic inventory-routing.
Comput. Oper. Res.
Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte
2014 — ch.
Heuristics for the Vehicle Routing Problem.
Vehicle Routing
Gilbert Laporte, Stefan Ropke, Thibaut Vidal
2014 J jnl
Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem.
Eur. J. Oper. Res.
Karine Sinclair, Jean-François Cordeau, Gilbert Laporte
2014 J jnl
Locating replenishment stations for electric vehicles: application to Danish traffic data.
J. Oper. Res. Soc.
Min Wen, Gilbert Laporte, Oli B. G. Madsen, Anders V. Nørrelund, Allan Olsen
2014 J jnl
Optimal joint replenishment, delivery and inventory management policies for perishable products.
Comput. Oper. Res.
Leandro C. Coelho, Gilbert Laporte
2014 J jnl
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands.
Discret. Appl. Math.
Ola Jabali, Walter Rei, Michel Gendreau, Gilbert Laporte
2014 C conf
Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints.
ATMOS
Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea
2014 J jnl
The Tube Challenge.
INFOR Inf. Syst. Oper. Res.
Gilbert Laporte
2014 J jnl
The bi-objective Pollution-Routing Problem.
Eur. J. Oper. Res.
Emrah Demir, Tolga Bektas, Gilbert Laporte
2014 J jnl
The dynamic multiperiod vehicle routing problem with probabilistic information.
Comput. Oper. Res.
Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte
2014 J jnl
The multi-district team orienteering problem.
Comput. Oper. Res.
M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte
2014 J jnl
The static bicycle relocation problem with demand intervals.
Eur. J. Oper. Res.
Günes Erdogan, Gilbert Laporte, Roberto Wolfler Calvo
2014 J jnl
Thirty Years of Inventory Routing.
Transp. Sci.
Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte
2013 J jnl
An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand.
Oper. Res.
Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte
2013 J jnl
Analysis of an exact algorithm for the vessel speed optimization problem.
Networks
Lars Magnus Hvattum, Inge Norstad, Kjetil Fagerholt, Gilbert Laporte
2013 J jnl
Improved lower bounds and exact algorithm for the capacitated arc routing problem.
Math. Program.
Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte
2013 J jnl
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules.
Transp. Sci.
Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte
2013 J jnl
Rapid transit network design for optimal cost and origin-destination demand capture.
Comput. Oper. Res.
Gabriel Gutiérrez-Jarpa, Carlos Obreque, Gilbert Laporte, Vladimir Marianov
2013 J jnl
Rich routing problems arising in supply chain management.
Eur. J. Oper. Res.
Verena Schmid, Karl F. Doerner, Gilbert Laporte
2013 J jnl
The exact solution of several classes of inventory-routing problems.
Comput. Oper. Res.
Leandro C. Coelho, Gilbert Laporte
2013 J jnl
The orienteering problem with variable profits.
Networks
Günes Erdogan, Gilbert Laporte
2013 J jnl
The synchronized arc and node routing problem: Application to road marking.
Comput. Oper. Res.
M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte
2013 J jnl
Vehicle routing: historical perspective and recent contributions.
EURO J. Transp. Logist.
Gilbert Laporte, Paolo Toth, Daniele Vigo
2012 J jnl
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem.
INFORMS J. Comput.
Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet
2012 J jnl
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.
INFORMS J. Comput.
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte
2012 J jnl
A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations.
INFOR Inf. Syst. Oper. Res.
Aliaksandr Shyshou, Irina Gribkovskaia Sr., Gilbert Laporte, Kjetil Fagerholt
2012 J jnl
A branch-and-cut algorithm for the preemptive swapping problem.
Networks
Charles Bordenave, Michel Gendreau, Gilbert Laporte
2012 J jnl
A comparison of three metaheuristics for the workover rig routing problem.
Eur. J. Oper. Res.
Glaydston Mattos Ribeiro, Gilbert Laporte, Geraldo Regis Mauri
2012 J jnl
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem.
Eur. J. Oper. Res.
Emrah Demir, Tolga Bektas, Gilbert Laporte
2012 J jnl
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem.
Comput. Oper. Res.
Glaydston Mattos Ribeiro, Gilbert Laporte
2012 J jnl
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows.
J. Oper. Res. Soc.
Luigi Moccia, Jean-François Cordeau, Gilbert Laporte
2012 J jnl
Automatic aircraft cargo load planning.
J. Oper. Res. Soc.
Sabine Limbourg, Michaël Schyns, Gilbert Laporte
2012 J jnl
Districting for routing with stochastic customers.
EURO J. Transp. Logist.
Hongtao Lei, Gilbert Laporte, Bo Guo
2012 J jnl
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels.
Transp. Sci.
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
2012 J jnl
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.
Comput. Oper. Res.
Günes Erdogan, Maria Battarra, Gilbert Laporte, Daniele Vigo
2012 J jnl
Robust Inventory Routing Under Demand Uncertainty.
Transp. Sci.
Oguz Solyali, Jean-François Cordeau, Gilbert Laporte
2012 J jnl
Synchronized arc routing for snow plowing operations.
Comput. Oper. Res.
M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte
2012 J jnl
The Traveling Salesman Problem with Draft Limits.
Comput. Oper. Res.
Jørgen Glomvik Rakke, Marielle Christiansen, Kjetil Fagerholt, Gilbert Laporte
2012 J jnl
The Vehicle Routing Problem with Stochastic Demands and Split Deliveries.
INFOR Inf. Syst. Oper. Res.
Hongtao Lei, Gilbert Laporte, Bo Guo
2012 J jnl
The inventory-routing problem with transshipment.
Comput. Oper. Res.
Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte
2012 J jnl
The undirected m-Capacitated Peripatetic Salesman Problem.
Eur. J. Oper. Res.
Éric Duchêne, Gilbert Laporte, Frédéric Semet
2011 J jnl
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants.
Comput. Oper. Res.
Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet
2011 J jnl
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem.
Comput. Oper. Res.
Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte
2011 J jnl
A large neighbourhood search heuristic for ship routing and scheduling with split loads.
Comput. Oper. Res.
Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte
2011 J jnl
A large neighbourhood search heuristic for the aircraft and passenger recovery problem.
4OR
Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin
2011 J jnl
A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand.
Comput. Oper. Res.
Alper Ekrem Murat, Vedat Verter, Gilbert Laporte
2011 C conf
An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes.
INOC
M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte
2011 J jnl
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays.
Discret. Appl. Math.
Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte
2011 J jnl
Benders Decomposition for Large-Scale Uncapacitated Hub Location.
Oper. Res.
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
2011 J jnl
Designing New Electoral Districts for the City of Edmonton.
Interfaces
Burçin Bozkaya, Erhan Erkut, Dan Haight, Gilbert Laporte
2011 J jnl
Minimum cost path problems with relays.
Comput. Oper. Res.
Gilbert Laporte, Marta M. B. Pascoal
2011 J jnl
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services.
Networks
Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini
2011 J jnl
Optimizing yard assignment in an automotive transshipment terminal.
Eur. J. Oper. Res.
Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino
2011 J jnl
Stochastic uncapacitated hub location.
Eur. J. Oper. Res.
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
2011 J jnl
The Dynamic Uncapacitated Hub Location Problem.
Transp. Sci.
Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte
2011 J jnl
The capacitated vehicle routing problem with stochastic demands and time windows.
Comput. Oper. Res.
Hongtao Lei, Gilbert Laporte, Bo Guo
2011 J jnl
The preemptive swapping problem on a tree.
Networks
Shoshana Anily, Michel Gendreau, Gilbert Laporte
2010 J jnl
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discret. Appl. Math.
Günes Erdogan, Jean-François Cordeau, Gilbert Laporte
2010 J jnl
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.
Networks
Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González
2010 J jnl
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.
Eur. J. Oper. Res.
Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, Vladimir Marianov
2010 J jnl
A concise guide to the Traveling Salesman Problem.
J. Oper. Res. Soc.
Gilbert Laporte
2010 J jnl
A continuous analysis framework for the solution of location-allocation problems with dense demand.
Comput. Oper. Res.
Alper Ekrem Murat, Vedat Verter, Gilbert Laporte
2010 J jnl
A tabu search heuristic for ship routing and scheduling.
J. Oper. Res. Soc.
Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte
2010 J jnl
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars.
Eur. J. Oper. Res.
Marie-Claude Bolduc, Gilbert Laporte, Jacques Renaud, Fayez F. Boctor
2010 J jnl
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands.
Transp. Sci.
Gilbert Laporte, Roberto Musmanno, Francesca Vocaturo
2010 J jnl
An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions.
Eur. J. Oper. Res.
Leizer de Lima Pinto, Gilbert Laporte
2010 J jnl
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions.
J. Heuristics
Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, Francesco Mari
2010 J jnl
Dynamic pickup and delivery problems.
Eur. J. Oper. Res.
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte
2010 J jnl
Dynamic transportation of patients in hospitals.
OR Spectr.
Alexandre Beaudry, Gilbert Laporte, M. Teresa Melo, Stefan Nickel
2010 J jnl
Editorial.
J. Oper. Res. Soc.
Tolga Bektas, Gilbert Laporte
2010 J jnl
Heuristics for the mixed swapping problem.
Comput. Oper. Res.
Charles Bordenave, Michel Gendreau, Gilbert Laporte
2010 J jnl
Preface.
Networks
Dominique Feillet, Gilbert Laporte, Frédéric Semet
2010 J jnl
Reducing fuel emissions by optimizing speed on shipping routes.
J. Oper. Res. Soc.
Kjetil Fagerholt, Gilbert Laporte, Inge Norstad
2010 J jnl
Scheduling ambulance crews for maximum coverage.
J. Oper. Res. Soc.
Günes Erdogan, Erhan Erkut, Armann Ingolfsson, Gilbert Laporte
2010 J jnl
Scheduling technicians and tasks in a telecommunications company.
J. Sched.
Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke
2010 J jnl
Some applications of the generalized vehicle routing problem.
J. Oper. Res. Soc.
Roberto Baldacci, Enrico Bartolini, Gilbert Laporte
2010 J jnl
The Attractive Traveling Salesman Problem.
Eur. J. Oper. Res.
Günes Erdogan, Jean-François Cordeau, Gilbert Laporte
2010 J jnl
The Delivery Man Problem with time windows.
Discret. Optim.
Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte
2010 J jnl
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs.
Transp. Sci.
Maria Battarra, Günes Erdogan, Gilbert Laporte, Daniele Vigo
2010 J jnl
The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization.
Int. J. Strateg. Decis. Sci.
Gilbert Laporte
2010 J jnl
The dynamic multi-period vehicle routing problem.
Comput. Oper. Res.
Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen
2010 J jnl
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
Math. Program.
Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte
2009 J jnl
A comparative analysis of several asymmetric traveling salesman problem formulations.
Comput. Oper. Res.
Temel Öncan, I. Kuban Altinel, Gilbert Laporte
2009 J jnl
Fifty Years of Vehicle Routing.
Transp. Sci.
Gilbert Laporte
2009 J jnl
Guest Editorial - Focused Issue on Freight Transportation.
Transp. Sci.
Teodor Gabriel Crainic, Gilbert Laporte, Vedat Verter
2009 J jnl
Heuristiques pour le Problème du Vendeur
RAIRO Oper. Res.
Éric Duchêne, Gilbert Laporte, Frédéric Semet
2009 J jnl
Integration of operational policies into the design phase of a material handling network.
Int. J. Adv. Oper. Manag.
Ardavan Asef-Vaziri, Gilbert Laporte
2009 J jnl
Lasso solution strategies for the vehicle routing problem with pickups and deliveries.
Eur. J. Oper. Res.
Arild Hoff, Irina Gribkovskaia Sr., Gilbert Laporte, Arne Løkketangen
2009 J jnl
Locating Satellite Yards in Forestry Operations.
INFOR Inf. Syst. Oper. Res.
Tuyva Chan, Jean-François Cordeau, Gilbert Laporte
2009 J jnl
Locating a metro line in a historical city centre: application to Sevilla.
J. Oper. Res. Soc.
Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo
2009 J jnl
Locational analysis: highlights of growth to maturity.
J. Oper. Res. Soc.
Honora K. Smith, Gilbert Laporte, Paul R. Harper
2009 J jnl
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.
Networks
Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte
2009 J jnl
Partial integration of frequency allocation within antenna positioning in GSM mobile networks.
Eur. J. Oper. Res.
Souheyl Touhami, Jean-Marie Bourjolly, Gilbert Laporte
2009 J jnl
Quality of service in dial-a-ride operations.
Comput. Ind. Eng.
Julie Paquette, Jean-François Cordeau, Gilbert Laporte
2009 J jnl
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems.
INFORMS J. Comput.
Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte
2009 — ch.
Stochastic Vehicle Routing Problems.
Encyclopedia of Optimization
François V. Louveaux, Gilbert Laporte
2009 J jnl
The capacity and distance constrained plant location problem.
Comput. Oper. Res.
Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte
2009 J jnl
The petrol station replenishment problem with time windows.
Comput. Oper. Res.
Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud
2009 J jnl
The pickup and delivery traveling salesman problem with first-in-first-out loading.
Comput. Oper. Res.
Günes Erdogan, Jean-François Cordeau, Gilbert Laporte
2009 J jnl
Vehicle routing with cross-docking.
J. Oper. Res. Soc.
Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte
2008 J jnl
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.
Networks
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
2008 J jnl
A heuristic for the multi-period petrol station replenishment problem.
Eur. J. Oper. Res.
Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud
2008 J jnl
A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers.
J. Oper. Res. Soc.
Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
2008 J jnl
A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms.
J. Oper. Res. Soc.
Irina V. Gribkovskaia, Gilbert Laporte, A. Shlopak
2008 J jnl
A tabu search heuristic for the generalized minimum spanning tree problem.
Eur. J. Oper. Res.
Temel Öncan, Jean-François Cordeau, Gilbert Laporte
2008 J jnl
A two-level simulated annealing algorithm for efficient dissemination of electronic content.
J. Oper. Res. Soc.
Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte
2008 J jnl
An exact algorithm for the petrol station replenishment problem.
J. Oper. Res. Soc.
Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud
2008 J jnl
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.
Networks
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
2008 J jnl
Exact algorithms for the joint object placement and request routing problem in content distribution networks.
Comput. Oper. Res.
Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte
2008 J jnl
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.
Eur. J. Oper. Res.
Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte
2008 J jnl
Horizontal cooperation among freight carriers: request allocation and profit sharing.
J. Oper. Res. Soc.
Marta Anna Krajewska, Herbert Kopfer, Gilbert Laporte, Stefan Ropke, Georges Zaccour
2008 J jnl
Iterated tabu search for the car sequencing problem.
Eur. J. Oper. Res.
Jean-François Cordeau, Gilbert Laporte, Federico Pasin
2008 J jnl
Operational Research: Milestones and Highlights of Canadian Contributions.
INFOR Inf. Syst. Oper. Res.
Gilbert Laporte
2008 J jnl
Special Issue of INFOR in Honour of the 50th Anniversary of the Canadian Operational Research Society.
INFOR Inf. Syst. Oper. Res.
Gilbert Laporte
2008 J jnl
Special Issue of INFOR in Honour of the 50th Anniversary of the Canadian Operational Research Society.
INFOR Inf. Syst. Oper. Res.
Gilbert Laporte
2008 J jnl
The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan.
INFORMS J. Comput.
H. Neil Geismar, Gilbert Laporte, Lei Lei, Chelliah Sriskandarajah
2008 J jnl
The maximum return-on-investment plant location problem with market share.
J. Oper. Res. Soc.
Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic
2008 J jnl
The single vehicle routing problem with deliveries and selective pickups.
Comput. Oper. Res.
Irina Gribkovskaia Sr., Gilbert Laporte, Aliaksandr Shyshou
2008 J jnl
Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows.
INFOR Inf. Syst. Oper. Res.
Vitória Pureza, Gilbert Laporte
2008 J jnl
Wide area telecommunication network design: application to the Alberta SuperNet.
J. Oper. Res. Soc.
Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson
2007 J jnl
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.
Transp. Sci.
Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza
2007 J jnl
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems.
Networks
Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte
2007 J jnl
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
Eur. J. Oper. Res.
Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond
2007 J jnl
A tabu search heuristic for the quay crane scheduling problem.
J. Sched.
Marcello Sammarra, Jean-François Cordeau, Gilbert Laporte, Maria Flavia Monaco
2007 — ch.
Chapter 6 Vehicle Routing.
Transportation
Jean-François Cordeau, Gilbert Laporte, Martin W. P. Savelsbergh, Daniele Vigo
2007 — ch.
Chapter 7 Transportation on Demand.
Transportation
Jean-François Cordeau, Gilbert Laporte, Jean-Yves Potvin, Martin W. P. Savelsbergh
2007 J jnl
Designing delivery districts for the vehicle routing problem with stochastic demands.
Eur. J. Oper. Res.
Dag Haugland, Sin C. Ho, Gilbert Laporte
2007 J jnl
Erratum to "A Continuous Model for Multistore Competitive Location".
Oper. Res.
Abdullah Dasci, Gilbert Laporte
2007 J jnl
Exact and heuristic procedures for the material handling circular flow path design problem.
Eur. J. Oper. Res.
Ardavan Asef-Vaziri, Gilbert Laporte, Robert Ortiz
2007 J jnl
General solutions to the single vehicle routing problem with pickups and deliveries.
Eur. J. Oper. Res.
Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte, Martin Vlcek
2007 J jnl
Heuristic and lower bound for a stochastic location-routing problem.
Eur. J. Oper. Res.
Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte
2007 J jnl
Improvements to the Or-opt heuristic for the symmetric travelling salesman problem.
J. Oper. Res. Soc.
Gilbert Babin, S. Deneault, Gilbert Laporte
2007 J jnl
Locating a cycle in a transportation or a telecommunications network.
Networks
Gilbert Laporte, Inmaculada Rodríguez Martín
2007 J jnl
Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
Networks
Stefan Ropke, Jean-François Cordeau, Gilbert Laporte
2007 — ch.
Preface.
Transportation
Cynthia Barnhart, Gilbert Laporte
2007 J jnl
The Undirected
Oper. Res.
Éric Duchêne, Gilbert Laporte, Frédéric Semet
2007 J jnl
The bridges of Königsberg - A historical perspective.
Networks
Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte
2007 J jnl
The dial-a-ride problem: models and algorithms.
Ann. Oper. Res.
Jean-François Cordeau, Gilbert Laporte
2007 J jnl
The multi-depot vehicle routing problem with inter-depot routes.
Eur. J. Oper. Res.
Benoit Crevier, Jean-François Cordeau, Gilbert Laporte
2007 J jnl
The network design problem with relays.
Eur. J. Oper. Res.
Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson
2007 J jnl
The service allocation problem at the Gioia Tauro Maritime Terminal.
Eur. J. Oper. Res.
Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia
2007 — book
Transportation
Cynthia Barnhart, Gilbert Laporte
2007 J jnl
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique.
INFOR Inf. Syst. Oper. Res.
Ghislain Dubuc, Jean-François Cordeau, Gilbert Laporte, Tolga Bektas
2007 J jnl
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
INFORMS J. Comput.
Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte
2007 J jnl
Étude comparative de divers modèles pour le problème de transport à la demande.
INFOR Inf. Syst. Oper. Res.
Julie Paquette, Jean-François Cordeau, Gilbert Laporte
2006 J jnl
A Memetic Heuristic for the Generalized Quadratic Assignment Problem.
INFORMS J. Comput.
Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia
2006 J jnl
A Tabu Search Algorithm for a Routing and Container Loading Problem.
Transp. Sci.
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello
2006 J jnl
Designing an efficient method for tandem AGV network design problem using tabu search.
Appl. Math. Comput.
Gilbert Laporte, Reza Zanjirani Farahani, Elnaz Miandoabchi
2006 J jnl
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic.
Transp. Sci.
Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte
2006 J jnl
Solving a vehicle-routing problem arising in soft-drink distribution.
J. Oper. Res. Soc.
J. Privé, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
2006 J jnl
The Black and White Traveling Salesman Problem.
Oper. Res.
Gianpaolo Ghiani, Gilbert Laporte, Frédéric Semet
2006 J jnl
The maximal expected coverage relocation problem for emergency vehicles.
J. Oper. Res. Soc.
Michel Gendreau, Gilbert Laporte, Frédéric Semet
2005 J jnl
A Continuous Model for Multistore Competitive Location.
Oper. Res.
Abdullah Dasci, Gilbert Laporte
2005 J jnl
An analytical approach to the facility location and capacity acquisition problem under demand uncertainty.
J. Oper. Res. Soc.
Abdullah Dasci, Gilbert Laporte
2005 J jnl
Branch-and-cut algorithms for the undirected m.
Eur. J. Oper. Res.
Éric Duchêne, Gilbert Laporte, Frédéric Semet
2005 J jnl
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem.
Networks
Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno
2005 J jnl
Foreword.
Ann. Oper. Res.
Horst A. Eiselt, Gilbert Laporte, Vedat Verter
2005 J jnl
Locating median cycles in networks.
Eur. J. Oper. Res.
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
2005 J jnl
Loop based facility planning and material handling.
Eur. J. Oper. Res.
Ardavan Asef-Vaziri, Gilbert Laporte
2005 J jnl
Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment.
Ann. Oper. Res.
Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Ignacio Sevillano
2005 J jnl
Maximizing the value of an Earth observation satellite orbit.
J. Oper. Res. Soc.
Jean-François Cordeau, Gilbert Laporte
2005 J jnl
Models and Tabu Search Heuristics for the Berth-Allocation Problem.
Transp. Sci.
Jean-François Cordeau, Gilbert Laporte, Pasquale Legato, Luigi Moccia
2004 — ch.
A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem.
Handbook of Scheduling
Richa Agarwal, Ravindra K. Ahuja, Gilbert Laporte, Zuo-Jun Max Shen
2004 J jnl
A general multi-shift scheduling system.
J. Oper. Res. Soc.
Gilbert Laporte, Gilles Pesant
2004 J jnl
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem.
Eur. J. Oper. Res.
Imdat Kara, Gilbert Laporte, Tolga Bektas
2004 C conf
An Integrated Methodology for the Rapid Transit Network Design Problem.
ATMOS
Gilbert Laporte, Ángel Marín, Juan A. Mesa, Francisco A. Ortega
2004 J jnl
Book review.
Oper. Res. Lett.
Gilbert Laporte
2004 J jnl
Efficient heuristics for Median Cycle Problems.
J. Oper. Res. Soc.
Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
2004 J jnl
Heuristics and lower bounds for the bin packing problem with conflicts.
Comput. Oper. Res.
Michel Gendreau, Gilbert Laporte, Frédéric Semet
2004 J jnl
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows.
J. Oper. Res. Soc.
Jean-François Cordeau, Gilbert Laporte, Anne Mercier
2004 J jnl
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem.
Parallel Comput.
Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte
2004 J jnl
Solving the hierarchical Chinese postman problem as a rural postman problem.
Eur. J. Oper. Res.
Edgar Alberto Cabral, Michel Gendreau, Gianpaolo Ghiani, Gilbert Laporte
2004 J jnl
Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions.
J. Math. Model. Algorithms
Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno
2004 J jnl
The Ring Star Problem: Polyhedral analysis and exact algorithm.
Networks
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
2004 J jnl
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.
Networks
Corinne Feremans, Martine Labbé, Gilbert Laporte
2003 J jnl
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.
Oper. Res.
Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González
2003 J jnl
A tabu search heuristic and adaptive memory procedure for political districting.
Eur. J. Oper. Res.
Burçin Bozkaya, Erhan Erkut, Gilbert Laporte
2003 J jnl
Ambulance location and relocation models.
Eur. J. Oper. Res.
Luce Brotcorne, Gilbert Laporte, Frédéric Semet
2003 J jnl
Exact solution of the generalized routing problem through graph transformations.
J. Oper. Res. Soc.
M. Blais, Gilbert Laporte
2003 J jnl
Generalized network design problems.
Eur. J. Oper. Res.
Corinne Feremans, Martine Labbé, Gilbert Laporte
2003 J jnl
Heuristics for the black and white traveling salesman problem.
Comput. Oper. Res.
Mélanie Bourgeois, Gilbert Laporte, Frédéric Semet
2003 J jnl
Heuristics for the traveling purchaser problem.
Comput. Oper. Res.
Fayez F. Boctor, Gilbert Laporte, Jacques Renaud
2003 J jnl
Parallel computing in logistics.
Parallel Comput.
Gilbert Laporte, Roberto Musmanno
2003 J jnl
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
Eur. J. Oper. Res.
Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno
2003 J jnl
Scheduling and Lot Streaming in Flowshops with No-Wait in Process.
J. Sched.
Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah
2003 J jnl
Solving a home-care districting problem in an urban setting.
J. Oper. Res. Soc.
M. Blais, Sophie D. Lapierre, Gilbert Laporte
2003 J jnl
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms.
4OR
Jean-François Cordeau, Gilbert Laporte
2003 J jnl
Upper bounds and algorithms for the maximum cardinality bin packing problem.
Eur. J. Oper. Res.
Martine Labbé, Gilbert Laporte, Silvano Martello
2002 J jnl
A comparative analysis of several formulations for the generalized minimum spanning tree problem.
Networks
Corinne Feremans, Martine Labbé, Gilbert Laporte
2002 J jnl
A guide to vehicle routing heuristics.
J. Oper. Res. Soc.
Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet
2002 J jnl
A heuristic for the location of a rapid transit line.
Comput. Oper. Res.
Giuseppe Bruno, Michel Gendreau, Gilbert Laporte
2002 J jnl
A simple enhancement of the Esau-Williams heuristic for the capacitated minimum spanning tree problem.
J. Oper. Res. Soc.
Giuseppe Bruno, Gilbert Laporte
2002 J jnl
An Integer
Oper. Res.
Gilbert Laporte, François V. Louveaux, Luc van Hamme
2002 J jnl
An exact algorithm for the maximum k-club problem in an undirected graph.
Eur. J. Oper. Res.
Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant
2002 — ch.
Classical Heuristics for the Capacitated VRP.
The Vehicle Routing Problem
Gilbert Laporte, Frédéric Semet
2002 J jnl
Fast heuristics for large scale covering-location problems.
Comput. Oper. Res.
Luce Brotcorne, Gilbert Laporte, Frédéric Semet
2002 J jnl
Locating stations on rapid transit lines.
Comput. Oper. Res.
Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega
2002 — ch.
Metaheuristics for the Capacitated VRP.
The Vehicle Routing Problem
Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin
2002 J jnl
On the (
Ann. Oper. Res.
Abdullah Dasci, Horst A. Eiselt, Gilbert Laporte
2002 J jnl
Perturbation heuristics for the pickup and delivery traveling salesman problem.
Comput. Oper. Res.
Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
2002 J jnl
Some applications of the clustered travelling salesman problem.
J. Oper. Res. Soc.
Gilbert Laporte, Udatta S. Palekar
2001 J jnl
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times.
Eur. J. Oper. Res.
Michel Gendreau, Gilbert Laporte, Eduardo Morais Guimarães
2001 J jnl
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation.
Parallel Comput.
Michel Gendreau, Gilbert Laporte, Frédéric Semet
2001 J jnl
A unified tabu search heuristic for vehicle routing problems with time windows.
J. Oper. Res. Soc.
Jean-François Cordeau, Gilbert Laporte, Anne Mercier
2001 J jnl
On generalized minimum spanning trees.
Eur. J. Oper. Res.
Corinne Feremans, Martine Labbé, Gilbert Laporte
2001 J jnl
Preface.
Discret. Appl. Math.
Martine Labbé, Gilbert Laporte, Silvano Martello
2001 J jnl
Solving arc routing problems with turn penalties.
J. Oper. Res. Soc.
Jacinthe Clossey, Gilbert Laporte, Patrick Soriano
2001 J jnl
The capacitated arc routing problem with intermediate facilities.
Networks
Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte
2000 J jnl
A Tabu Search Heuristic for the Capacitated Arc Routing Problem.
Oper. Res.
Alain Hertz, Gilbert Laporte, Michel Mittaz
2000 J jnl
A branch-and-cut algorithm for the Undirected Rural Postman Problem.
Math. Program.
Gianpaolo Ghiani, Gilbert Laporte
2000 J jnl
Heuristics for finding
Comput. Oper. Res.
Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant
2000 J jnl
Heuristics for the multi-vehicle covering tour problem.
Comput. Oper. Res.
Mondher Hachicha, M. John Hodgson, Gilbert Laporte, Frédéric Semet
2000 J jnl
Optimization methods for the planning of rapid transit systems.
Eur. J. Oper. Res.
Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega
2000 J jnl
The Uncapacitated Facility Location Problem with Client Matching.
Oper. Res.
Éric Gourdin, Martine Labbé, Gilbert Laporte
1999 J jnl
A tabu search heuristic for the heterogeneous fleet vehicle routing problem.
Comput. Oper. Res.
Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard
1999 J jnl
An emergency vehicle dispatching system for an electric utility in Chile.
J. Oper. Res. Soc.
Andrés Weintraub, Julio Aboud, Claudio Fernández, Gilbert Laporte, Enrique Ramírez
1999 J jnl
An optimality cut for mixed integer linear programs.
Eur. J. Oper. Res.
Gilbert Laporte, Frédéric Semet
1999 J jnl
Eulerian location problems.
Networks
Gianpaolo Ghiani, Gilbert Laporte
1999 J jnl
Heuristics for the traveling salesman problem with pickup and delivery.
Comput. Oper. Res.
Michel Gendreau, Gilbert Laporte, Daniele Vigo
1999 J jnl
Improvement Procedures for the Undirected Rural Postman Problem.
INFORMS J. Comput.
Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo
1999 J jnl
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut.
Electron. Notes Discret. Math.
Corinne Feremans, Martine Labbé, Gilbert Laporte
1999 J jnl
The Swapping Problem on a Line.
SIAM J. Comput.
Shoshana Anily, Michel Gendreau, Gilbert Laporte
1999 J jnl
The art and science of designing rotating schedules.
J. Oper. Res. Soc.
Gilbert Laporte
1998 J jnl
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.
Oper. Res.
Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan
1998 J jnl
A branch-and-cut algorithm for the undirected selective traveling salesman problem.
Networks
Michel Gendreau, Gilbert Laporte, Frédéric Semet
1998 J jnl
A tabu search heuristic for the undirected selective travelling salesman problem.
Eur. J. Oper. Res.
Michel Gendreau, Gilbert Laporte, Frédéric Semet
1998 J jnl
A tiling and routing heuristic for the screening of cytological samples.
J. Oper. Res. Soc.
Gilbert Laporte, Frédéric Semet, V. V. Dadeshidze, L. J. Olsson
1998 J jnl
Covering a graph with cycles.
Comput. Oper. Res.
Martine Labbé, Gilbert Laporte, Patrick Soriano
1998 J jnl
Scheduling linen deliveries in a large hospital.
J. Oper. Res. Soc.
M. Banerjea-Brodeur, Jean-François Cordeau, Gilbert Laporte, A. Lasry
1997 J jnl
A combinatorial column generation algorithm for the maximum stable set problem.
Oper. Res. Lett.
Jean-Marie Bourjolly, Gilbert Laporte, Hélène Mercure
1997 J jnl
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem.
Networks
Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman
1997 J jnl
A tabu search heuristic for periodic and multi-depot vehicle routing problems.
Networks
Jean-François Cordeau, Michel Gendreau, Gilbert Laporte
1997 J jnl
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem.
J. Heuristics
Gilbert Laporte, Jean-Yves Potvin, Florence Quilleret
1997 J jnl
An Approximation Algorithm for the Traveling Salesman Problem with Backhauls.
Oper. Res.
Michel Gendreau, Gilbert Laporte, Alain Hertz
1997 J jnl
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.
Comput. Oper. Res.
Bruce L. Golden, Gilbert Laporte, Éric D. Taillard
1997 J jnl
Modeling and solving several classes of arc routing problems as traveling salesman problems.
Comput. Oper. Res.
Gilbert Laporte
1997 C conf
Recent Developments in Practical Course Timetabling.
PATAT
Michael W. Carter, Gilbert Laporte
1997 J jnl
The Covering Tour Problem.
Oper. Res.
Michel Gendreau, Gilbert Laporte, Frédéric Semet
1996 J jnl
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem.
INFORMS J. Comput.
Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
1996 J jnl
A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers.
Oper. Res.
Michel Gendreau, Gilbert Laporte, René Séguin
1996 J jnl
A tabu search heuristic for the multi-depot vehicle routing problem.
Comput. Oper. Res.
Jacques Renaud, Gilbert Laporte, Fayez F. Boctor
1996 J jnl
Foreword.
Ann. Oper. Res.
Gilbert Laporte, Ibrahim H. Osman
1996 J jnl
Metaheuristics: A bibliography.
Ann. Oper. Res.
Ibrahim H. Osman, Gilbert Laporte
1996 J jnl
Optimal Location of Facilities on a Network with an Unreliable Node or Link.
Inf. Process. Lett.
Horst A. Eiselt, Michel Gendreau, Gilbert Laporte
1996 J jnl
The Plant Location Problem: New Models and Research Prospects.
Oper. Res.
Charles S. ReVelle, Gilbert Laporte
1996 J jnl
The Traveling Salesman Problem with Backhauls.
Comput. Oper. Res.
Michel Gendreau, Alain Hertz, Gilbert Laporte
1995 J jnl
An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers.
Transp. Sci.
Michel Gendreau, Gilbert Laporte, René Séguin
1995 J jnl
An exact algorithm for the dual bin packing problem.
Oper. Res. Lett.
Martine Labbé, Gilbert Laporte, Silvano Martello
1995 J jnl
Arc Routing Problems, Part I: The Chinese Postman Problem.
Oper. Res.
Horst A. Eiselt, Michel Gendreau, Gilbert Laporte
1995 J jnl
Arc Routing Problems, Part II: The Rural Postman Problem.
Oper. Res.
Horst A. Eiselt, Michel Gendreau, Gilbert Laporte
1995 J jnl
Efficient heuristics for the design of ring networks.
Telecommun. Syst.
Michel Gendreau, Martine Labbé, Gilbert Laporte
1995 J jnl
Foreword.
Ann. Oper. Res.
Michel Gendreau, Gilbert Laporte
1995 J jnl
Foreword.
Ann. Oper. Res.
Michel Gendreau, Gilbert Laporte
1995 C conf
Recent Developments in Practical Examination Timetabling.
PATAT
Michael W. Carter, Gilbert Laporte
1995 J jnl
Routing problems: A bibliography.
Ann. Oper. Res.
Gilbert Laporte, Ibrahim H. Osman
1995 J jnl
Single-Vehicle Routing and Scheduling to Minimize the Number of Delays.
Transp. Sci.
Michel Gendreau, Gilbert Laporte, Marius M. Solomon
1995 J jnl
The
Transp. Sci.
Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller
1994 J jnl
A Priori Optimization of the Probabilistic Traveling Salesman Problem.
Oper. Res.
Gilbert Laporte, François V. Louveaux, Hélène Mercure
1994 J jnl
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective.
Comput. Oper. Res.
Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller
1994 J jnl
Exact Solution to a Location Problem with Stochastic Demands.
Transp. Sci.
Gilbert Laporte, François V. Louveaux, Luc van Hamme
1994 J jnl
Vehicle routing with split deliveries.
Discret. Appl. Math.
Moshe Dror, Gilbert Laporte, Pierre Trudeau
1993 — conf
An exact quadratic 0-1 algorithm for the stable set problem.
Cliques, Coloring, and Satisfiability
Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure
1993 J jnl
Competitive Location Models: A Framework and Bibliography.
Transp. Sci.
Horst A. Eiselt, Gilbert Laporte, Jacques-François Thisse
1993 J jnl
Designing collection routes through bank branches.
Comput. Oper. Res.
Véronique Lambert, Gilbert Laporte, François V. Louveaux
1993 J jnl
The Delivery Man Problem and Cumulative Matroids.
Oper. Res.
Matteo Fischetti, Gilbert Laporte, Silvano Martello
1993 J jnl
The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree.
Transp. Sci.
Horst A. Eiselt, Gilbert Laporte
1993 J jnl
The integer L-shaped method for stochastic integer programs with complete recourse.
Oper. Res. Lett.
Gilbert Laporte, François V. Louveaux
1993 J jnl
Vehicle routing with stochastic demands and restricted failures.
ZOR Methods Model. Oper. Res.
Moshe Dror, Gilbert Laporte, François V. Louveaux
1992 J jnl
Location of facilities on a network subject to a single-edge failure.
Networks
Horst A. Eiselt, Michel Gendreau, Gilbert Laporte
1992 J jnl
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.
Oper. Res.
Michel Gendreau, Alain Hertz, Gilbert Laporte
1992 J jnl
Selected Abstracts for the 1990-1991 Transportation Science Section Dissertation Prize Competition.
Transp. Sci.
Gilbert Laporte
1992 J jnl
The Vehicle Routing Problem with Stochastic Travel Times.
Transp. Sci.
Gilbert Laporte, François V. Louveaux, Hélène Mercure
1991 J jnl
Capacitated Vehicle Routing on Trees.
Oper. Res.
Martine Labbé, Gilbert Laporte, Hélène Mercure
1991 J jnl
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.
Oper. Res. Lett.
Martin Desrochers, Gilbert Laporte
1990 J jnl
The selective travelling salesman problem.
Discret. Appl. Math.
Gilbert Laporte, Silvano Martello
1989 J jnl
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks.
Transp. Sci.
Moshe Dror, Gilbert Laporte, Pierre Trudeau
1988 J jnl
Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems.
Transp. Sci.
Gilbert Laporte, Yves Nobert, Serge Taillefer
1988 J jnl
Vehicle routing with full loads.
Comput. Oper. Res.
Jacques Desrosiers, Gilbert Laporte, Michel Sauvé, François Soumis, Serge Taillefer
1987 J jnl
Generalized travelling salesman problem through n sets of nodes: the asymmetrical case.
Discret. Appl. Math.
Gilbert Laporte, Hélène Mercure, Yves Nobert
1986 J jnl
An exact algorithm for the asymmetrical capacitated vehicle routing problem.
Networks
Gilbert Laporte, Hélène Mercure, Yves Nobert
1986 J jnl
The problem of assigning students to course sections in a large engineering school.
Comput. Oper. Res.
Gilbert Laporte, Sylvain Desroches
1985 J jnl
Optimal Routing under Capacity and Distance Restrictions.
Oper. Res.
Gilbert Laporte, Yves Nobert, Martin Desrochers
1984 J jnl
Examination timetabling by computer.
Comput. Oper. Res.
Gilbert Laporte, Sylvain Desroches
1984 J jnl
Two exact algorithms for the distance-constrained vehicle routing problem.
Networks
Gilbert Laporte, Martin Desrochers, Yves Nobert
1975 — —
Permutation Programming: Problems, Methods and Applications.
Gilbert Laporte