Gilbert Laporte

According to our database, Gilbert Laporte authored at least 426 papers between 1975 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A unifying framework for selective routing problems.

Cagla F. Dursunoglu, Okan Arslan, Sebnem Manolya Demir, Bahar Yetis Kara, Gilbert Laporte

Eur. J. Oper. Res., 2025

Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services.

Ziru Lin, Xiaofeng Xu, Emrah Demir, Gilbert Laporte

Comput. Oper. Res., 2025

50 years of Computers & Operations Research: A bibliometric analysis.

Li Guan, Gilbert Laporte, José M. Merigó, Stefan Nickel, Iman Rahimi, Francisco Saldanha-da-Gama

Comput. Oper. Res., 2025

2024

Operational Research: methods and applications.

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

J. Oper. Res. Soc., March, 2024

A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves.

Hani Zbib, Burcu Balcik, Marie-Ève Rancourt, Gilbert Laporte

Oper. Res., 2024

Determinism versus uncertainty: Examining the worst-case expected performance of data-driven policies.

Xuecheng Tian, Shuaian Wang, Gilbert Laporte, Ying Yang

Eur. J. Oper. Res., 2024

Vehicle routing with stochastic demand, service and waiting times - The case of food bank collection problems.

Meike Reusken, Gilbert Laporte, Sonja U. K. Rohmer, Frans Cruijssen

Eur. J. Oper. Res., 2024

Strategic flood impact mitigation in developing countries' urban road networks: Application to Hanoi.

Siao-Leu Phouratsamay, Maria Paola Scaparra, Trung Hieu Tran, Gilbert Laporte

Eur. J. Oper. Res., 2024

Fifty years of operational research: 1972-2022.

Gilbert Laporte

Eur. J. Oper. Res., 2024

The Impact of Partial Production Capacity Sharing via Production as a Service.

Christina J. Liepold, Okan Arslan, Gilbert Laporte, Maximilian Schiffer

Comput. Oper. Res., 2024

Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem.

David Canca, Eva Barrena, Gilbert Laporte

Comput. Oper. Res., 2024

Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms.

Pedram Beldar, Maria Battarra, Gilbert Laporte

Comput. Oper. Res., 2024

2023

Making opportunity sales in attended home delivery.

Çelen Naz Ötken, Baris Yildiz, Okan Arslan, Gilbert Laporte

Comput. Oper. Res., December, 2023

Heterogeneous instant delivery orders scheduling and routing problem.

Lu Zhen, Jingwen Wu, Gilbert Laporte, Zheyi Tan

Comput. Oper. Res., September, 2023

Territorial design for customers with demand frequency.

Lu Zhen, Jiajing Gao, Zheyi Tan, Gilbert Laporte, Roberto Baldacci

Eur. J. Oper. Res., August, 2023

A matheuristic for the multi-product maritime inventory routing problem.

Homayoun Shaabani, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte

Comput. Oper. Res., June, 2023

A location-or-routing problem with partial and decaying coverage.

Maryam Haghi, Okan Arslan, Gilbert Laporte

Comput. Oper. Res., 2023

2022

The Electric Vehicle Routing Problem with Capacitated Charging Stations.

Aurélien Froger, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte

Transp. Sci., 2022

Mode boundaries of automated metro and semi-rapid rail in urban transit.

Luigi Moccia, Duncan W. Allen, Gilbert Laporte, Andrea Spinosa

Public Transp., 2022

Optimal Picking Policies in E-Commerce Warehouses.

Maximilian Schiffer, Nils Boysen, Patrick S. Klein, Gilbert Laporte, Marco Pavone

Manag. Sci., 2022

Single Allocation Hub Location with Heterogeneous Economies of Scale.

Borzou Rostami, Masoud Chitsaz, Okan Arslan, Gilbert Laporte, Andrea Lodi

Oper. Res., 2022

A column generation-based heuristic for a rehabilitation patient scheduling and routing problem.

Liyang Xiao, Lu Zhen, Gilbert Laporte, Roberto Baldacci, Chenghao Wang

Comput. Oper. Res., 2022

Transport of skips between recycling centers and treatment facilities.

Sanne Wøhlk, Gilbert Laporte

Comput. Oper. Res., 2022

Pallet location and job scheduling in a Twin-Robot system.

Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte

Comput. Oper. Res., 2022

Optimizing access to drinking water in remote areas. Application to Nepal.

Gilbert Laporte, Marie-Ève Rancourt, Jessica Rodríguez-Pereira, Selene Silvestri

Comput. Oper. Res., 2022

Solving real-size stochastic railway rapid transit network construction scheduling problems.

David Canca, Gilbert Laporte

Comput. Oper. Res., 2022

Minimum cost delivery of multi-item orders in e-commerce logistics.

M. Hakan Akyüz, Ibrahim Muter, Günes Erdogan, Gilbert Laporte

Comput. Oper. Res., 2022

A gap in scientific reporting.

Gilbert Laporte, Paolo Toth

4OR, 2022

2021

Solving a Real-World Urban Postal Service System Redesign Problem.

Hao Yu, Xu Sun, Wei Deng Solvang, Gilbert Laporte

Sci. Program., 2021

Reorganizing postal collection operations in urban areas as a result of declining mail volumes - A case study in Bologna.

Giuseppe Bruno, Manuel Cavola, Antonio Diglio, Gilbert Laporte, Carmela Piccolo

J. Oper. Res. Soc., 2021

Algorithms for the Calzedonia workload allocation problem.

Maria Battarra, Federico Fraboni, Oliver Thomasson, Günes Erdogan, Gilbert Laporte, Marco Formentini

J. Oper. Res. Soc., 2021

Periodic supply vessel planning under demand and weather uncertainty.

Yauheni Kisialiou, Irina V. Gribkovskaia, Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2021

Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions.

Bruno Salezza Vieira, Glaydston Mattos Ribeiro, Laura Bahiense, Roberto Edward Cruz, André Bergsten Mendes, Gilbert Laporte

Eur. J. Oper. Res., 2021

Integrated planning for electric commercial vehicle fleets: A case study for retail mid-haul logistics networks.

Maximilian Schiffer, Patrick S. Klein, Gilbert Laporte, Grit Walther

Eur. J. Oper. Res., 2021

Inbound and outbound flow integration for cross-docking operations.

Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte

Eur. J. Oper. Res., 2021

Some contributions of Ailsa H. Land to the study of the traveling salesman problem.

Gilbert Laporte

EURO J. Comput. Optim., 2021

A scalable dynamic parking allocation framework.

Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut

Comput. Oper. Res., 2021

A dynamic multi-period general routing problem arising in postal service and parcel delivery systems.

Demetrio Laganà, Gilbert Laporte, Francesca Vocaturo

Comput. Oper. Res., 2021

A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations.

Merve Keskin, Bülent Çatay, Gilbert Laporte

Comput. Oper. Res., 2021

2020

A spatially disaggregated model for the technology selection and design of a transit line.

Luigi Moccia, Duncan W. Allen, Gilbert Laporte

Public Transp., 2020

A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints.

Okan Arslan, Ola Jabali, Gilbert Laporte

INFORMS J. Comput., 2020

The parking allocation problem for connected vehicles.

Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut

J. Heuristics, 2020

A concise guide to existing and emerging vehicle routing problem variants.

Thibaut Vidal, Gilbert Laporte, Piotr Matl

Eur. J. Oper. Res., 2020

The commodity-split multi-compartment capacitated arc routing problem.

Hani Zbib, Gilbert Laporte

Comput. Oper. Res., 2020

Crowd-shipping with time windows and transshipment nodes.

Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte

Comput. Oper. Res., 2020

A review of vehicle routing with simultaneous pickup and delivery.

Çagri Koç, Gilbert Laporte, Ilknur Tükenmez

Comput. Oper. Res., 2020

2019

Vehicle Routing and Location Routing with Intermediate Stops: A Review.

Maximilian Schiffer, Michael Schneider, Grit Walther, Gilbert Laporte

Transp. Sci., 2019

An Exact Algorithm for Multilevel Uncapacitated Facility Location.

Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte

Transp. Sci., 2019

Exact Solution of Several Families of Location-Arc Routing Problems.

Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira

Transp. Sci., 2019

The electric vehicle routing problem with shared charging stations.

Çagri Koç, Ola Jabali, Jorge E. Mendoza, Gilbert Laporte

Int. Trans. Oper. Res., 2019

Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows.

Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim, Gilbert Laporte

J. Heuristics, 2019

The Steiner Traveling Salesman Problem and its extensions.

Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora

Eur. J. Oper. Res., 2019

An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows.

Giusy Macrina, Gilbert Laporte, Francesca Guerriero, Luigi Di Puglia Pugliese

Eur. J. Oper. Res., 2019

Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle.

Leandro C. Coelho, Gilbert Laporte, Arinei Lindbeck, Thibaut Vidal

CoRR, 2019

Integrated planning of ship deployment, service schedule and container routing.

Lu Zhen, Shuaian Wang, Gilbert Laporte, Yi Hu

Comput. Oper. Res., 2019

A vehicle routing problem arising in unmanned aerial monitoring.

Lu Zhen, Miao Li, Gilbert Laporte, Wencheng Wang

Comput. Oper. Res., 2019

A districting-based heuristic for the coordinated capacitated arc routing problem.

Sanne Wøhlk, Gilbert Laporte

Comput. Oper. Res., 2019

A two-echelon inventory routing problem for perishable products.

Sonja U. K. Rohmer, G. D. H. Claassen, Gilbert Laporte

Comput. Oper. Res., 2019

The green mixed fleet vehicle routing problem with partial battery recharging and time windows.

Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte

Comput. Oper. Res., 2019

Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations.

Merve Keskin, Gilbert Laporte, Bülent Çatay

Comput. Oper. Res., 2019

Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions.

Aurélien Froger, Jorge E. Mendoza, Ola Jabali, Gilbert Laporte

Comput. Oper. Res., 2019

Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer.

Marc-Antoine Coindreau, Olivier Gallay, Nicolas Zufferey, Gilbert Laporte

Comput. Oper. Res., 2019

Median and covering location problems with interconnected facilities.

Marilène Cherkesly, Mercedes Landete, Gilbert Laporte

Comput. Oper. Res., 2019

The railway rapid transit network construction scheduling problem.

David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa

Comput. Ind. Eng., 2019

2018

Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem.

Kai Wang, Lu Zhen, Shuaian Wang, Gilbert Laporte

Transp. Sci., 2018

A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem.

Anna Franceschetti, Dorothée Honhon, Gilbert Laporte, Tom Van Woensel

Transp. Sci., 2018

A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem.

Elena Fernández, Gilbert Laporte, Jessica Rodríguez-Pereira

Transp. Sci., 2018

The Chinese Postman Problem with Load-Dependent Costs.

Ángel Corberán, Günes Erdogan, Gilbert Laporte, Isaac Plana, José M. Sanchis

Transp. Sci., 2018

A fast heuristic for large-scale capacitated arc routing problems.

Sanne Wøhlk, Gilbert Laporte

J. Oper. Res. Soc., 2018

Long-haul vehicle routing and scheduling with idling options.

Çagri Koç, Ola Jabali, Gilbert Laporte

J. Oper. Res. Soc., 2018

Exact Solution of the Evasive Flow Capturing Problem.

Okan Arslan, Ola Jabali, Gilbert Laporte

Oper. Res., 2018

Scheduling twin robots in a palletising problem.

Oliver Thomasson, Maria Battarra, Günes Erdogan, Gilbert Laporte

Int. J. Prod. Res., 2018

Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities.

Maximilian Schiffer, Michael Schneider, Gilbert Laporte

Eur. J. Oper. Res., 2018

Multi-level facility location problems.

Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte

Eur. J. Oper. Res., 2018

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times.

Vitor Nesello, Anand Subramanian, Maria Battarra, Gilbert Laporte

Eur. J. Oper. Res., 2018

The static bike relocation problem with multiple vehicles and visits.

Teobaldo L. Bulhões Júnior, Anand Subramanian, Günes Erdogan, Gilbert Laporte

Eur. J. Oper. Res., 2018

Route and speed optimization for autonomous trucks.

Moncef Ilies Nasri, Tolga Bektas, Gilbert Laporte

Comput. Oper. Res., 2018

Vehicle routing with backhauls: Review and research perspectives.

Çagri Koç, Gilbert Laporte

Comput. Oper. Res., 2018

The periodic supply vessel planning problem with flexible departure times and coupled vessels.

Yauheni Kisialiou, Irina Gribkovskaia Sr., Gilbert Laporte

Comput. Oper. Res., 2018

An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling.

Lei He, Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Yingguo Chen

Comput. Oper. Res., 2018

Corridor-based metro network design with travel flow capture.

Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov

Comput. Oper. Res., 2018

Shared mobility systems: an updated survey.

Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo

Ann. Oper. Res., 2018

2017

The railway line frequency and size setting problem.

Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea

Public Transp., 2017

Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location.

Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte

INFORMS J. Comput., 2017

Resource constrained routing and scheduling: Review and research prospects.

Dimitris C. Paraskevopoulos, Gilbert Laporte, Panagiotis P. Repoussis, Christos D. Tarantilis

Eur. J. Oper. Res., 2017

A metaheuristic for the time-dependent pollution-routing problem.

Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom Van Woensel, Gilbert Laporte, Mark Stobbe

Eur. J. Oper. Res., 2017

Scheduling identical parallel machines with tooling constraints.

Andreza Cristina Beezão, Jean-François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse

Eur. J. Oper. Res., 2017

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs.

Sanne Wøhlk, Gilbert Laporte

Comput. Oper. Res., 2017

The pickup and delivery problem with time windows and handling operations.

Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte

Comput. Oper. Res., 2017

A branch-and-cut algorithm for the minimum branch vertices spanning tree problem.

Selene Silvestri, Gilbert Laporte, Raffaele Cerulli

Comput. Oper. Res., 2017

A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints.

Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte, André Langevin

Comput. Oper. Res., 2017

Vehicle routing with cross-dock selection.

Yousef Maknoon, Gilbert Laporte

Comput. Oper. Res., 2017

An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time.

Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Renjie He

Comput. Oper. Res., 2017

Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile.

Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia

Comput. Oper. Res., 2017

Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms.

Eirik Fernández Cuesta, Henrik Andersson, Kjetil Fagerholt, Gilbert Laporte

Comput. Oper. Res., 2017

An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem.

David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa

Comput. Oper. Res., 2017

Planning a selective delivery schedule through Adaptive Large Neighborhood Search.

Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Gilbert Laporte

Comput. Ind. Eng., 2017

The multi-vehicle cumulative covering tour problem.

David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte

Ann. Oper. Res., 2017

2016

50th Anniversary Invited Article - Goods Distribution with Electric Vehicles: Review and Research Perspectives.

Samuel Pelletier, Ola Jabali, Gilbert Laporte

Transp. Sci., 2016

An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines.

Roel G. van Anholt, Leandro C. Coelho, Gilbert Laporte, Iris F. A. Vis

Transp. Sci., 2016

The Rainbow Cycle Cover Problem.

Selene Silvestri, Gilbert Laporte, Raffaele Cerulli

Networks, 2016

Counting and enumerating feasible rotating schedules by means of Gröbner bases.

Raúl M. Falcón, Eva Barrena, David Canca, Gilbert Laporte

Math. Comput. Simul., 2016

The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty.

Oguz Solyali, Jean-François Cordeau, Gilbert Laporte

Manag. Sci., 2016

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015.

Leandro C. Coelho, Jacques Renaud, Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2016

The traveling salesman problem with time-dependent service times.

Duygu Tas, Michel Gendreau, Ola Jabali, Gilbert Laporte

Eur. J. Oper. Res., 2016

Large neighborhood search for multi-trip vehicle routing.

François V. Louveaux, Yasemin Arda, Yves Crama, Gilbert Laporte

Eur. J. Oper. Res., 2016

Thirty years of heterogeneous vehicle routing.

Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte

Eur. J. Oper. Res., 2016

The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm.

Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte

Eur. J. Oper. Res., 2016

An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem.

Ahmad Hemmati, Lars Magnus Hvattum, Marielle Christiansen, Gilbert Laporte

Eur. J. Oper. Res., 2016

Exact and heuristic algorithms for the Hamiltonian p-median problem.

Günes Erdogan, Gilbert Laporte, Antonio M. Rodríguez-Chía

Eur. J. Oper. Res., 2016

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.

Marilène Cherkesly, Guy Desaulniers, Stefan Irnich, Gilbert Laporte

Eur. J. Oper. Res., 2016

A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem.

Karine Sinclair, Jean-François Cordeau, Gilbert Laporte

Comput. Oper. Res., 2016

A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand.

Alper Ekrem Murat, Gilbert Laporte, Vedat Verter

Comput. Oper. Res., 2016

An adaptive large neighborhood search for the discrete and continuous Berth allocation problem.

Geraldo Regis Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena, Gilbert Laporte

Comput. Oper. Res., 2016

Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm.

Hongtao Lei, Rui Wang, Gilbert Laporte

Comput. Oper. Res., 2016

Berth allocation in an ore terminal with demurrage, despatch and maintenance.

Glaydston Mattos Ribeiro, Geraldo Regis Mauri, Saulo de Castro Beluco, Luiz Antonio Nogueira Lorena, Gilbert Laporte

Comput. Ind. Eng., 2016

Scheduling issues in vehicle routing.

Gilbert Laporte

Ann. Oper. Res., 2016

A general rapid network design, line planning and fleet investment integrated model.

David Canca, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa

Ann. Oper. Res., 2016

A short-turning policy for the management of demand disruptions in rapid transit systems.

David Canca, Eva Barrena, Gilbert Laporte, Francisco A. Ortega

Ann. Oper. Res., 2016

2015

Scheduling Twin Yard Cranes in a Container Block.

Amir Hossein Gharehgozli, Gilbert Laporte, Yugang Yu, René M. B. M. de Koster

Transp. Sci., 2015

Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading.

Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte

Transp. Sci., 2015

Transferability of collective transportation line networks from a topological and passenger demand perspective.

Eva Barrena, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa

Networks Heterog. Media, 2015

ASP, The Art and Science of Practice: Academia-Industry Interfacing in Operations Research in Montréal.

Laure Cabantous, Gilbert Laporte

Interfaces, 2015

Multi-level facility location as the maximization of a submodular set function.

Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte

Eur. J. Oper. Res., 2015

Classification, models and exact algorithms for multi-compartment delivery problems.

Leandro C. Coelho, Gilbert Laporte

Eur. J. Oper. Res., 2015

The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations.

Camilo Ortiz-Astorquiza, Iván A. Contreras, Gilbert Laporte

Discret. Appl. Math., 2015

Tactical network planning for food aid distribution in Kenya.

Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte, Ben Watkins

Comput. Oper. Res., 2015

Dynamic design of sales territories.

Hongtao Lei, Gilbert Laporte, Yajie Liu, Tao Zhang

Comput. Oper. Res., 2015

Path based algorithms for metro network design.

Gilbert Laporte, Marta M. B. Pascoal

Comput. Oper. Res., 2015

A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows.

Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte

Comput. Oper. Res., 2015

Model-based automatic neighborhood design by unsupervised learning.

Gianpaolo Ghiani, Gilbert Laporte, Emanuele Manni

Comput. Oper. Res., 2015

A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading.

Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte

Comput. Oper. Res., 2015

Integrated vehicle routing problems.

Tolga Bektas, Gilbert Laporte, Daniele Vigo

Comput. Oper. Res., 2015

Robust assembly line balancing with heterogeneous workers.

Mayron César O. Moreira, Jean-François Cordeau, Alysson M. Costa, Gilbert Laporte

Comput. Ind. Eng., 2015

Shared mobility systems.

Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo

4OR, 2015

A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem.

Yousef Ghiami, Tom Van Woensel, Marielle Christiansen, Gilbert Laporte

Proceedings of the Computational Logistics - 6th International Conference, 2015

A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper).

Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes.

Ibrahim Muter, Jean-François Cordeau, Gilbert Laporte

Transp. Sci., 2014

Thirty Years of Inventory Routing.

Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte

Transp. Sci., 2014

A comparison of several models for the hamiltonian <i>p</i>-median problem.

Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski

Networks, 2014

Locating replenishment stations for electric vehicles: application to Danish traffic data.

Min Wen, Gilbert Laporte, Oli B. G. Madsen, Anders V. Nørrelund, Allan Olsen

J. Oper. Res. Soc., 2014

A comparison of several enumerative algorithms for Sudoku.

Leandro C. Coelho, Gilbert Laporte

J. Oper. Res. Soc., 2014

Districting for Arc Routing.

Alexander Butsch, Jörg Kalcsics, Gilbert Laporte

INFORMS J. Comput., 2014

The Tube Challenge.

Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2014

Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem.

Karine Sinclair, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2014

The static bicycle relocation problem with demand intervals.

Günes Erdogan, Gilbert Laporte, Roberto Wolfler Calvo

Eur. J. Oper. Res., 2014

A review of recent research on green road freight transportation.

Emrah Demir, Tolga Bektas, Gilbert Laporte

Eur. J. Oper. Res., 2014

The bi-objective Pollution-Routing Problem.

Emrah Demir, Tolga Bektas, Gilbert Laporte

Eur. J. Oper. Res., 2014

Partial-route inequalities for the multi-vehicle routing problem with stochastic demands.

Ola Jabali, Walter Rei, Michel Gendreau, Gilbert Laporte

Discret. Appl. Math., 2014

The multi-district team orienteering problem.

M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte

Comput. Oper. Res., 2014

Optimal joint replenishment, delivery and inventory management policies for perishable products.

Leandro C. Coelho, Gilbert Laporte

Comput. Oper. Res., 2014

Heuristics for dynamic and stochastic inventory-routing.

Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte

Comput. Oper. Res., 2014

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.

Slim Belhaiza, Pierre Hansen, Gilbert Laporte

Comput. Oper. Res., 2014

Exact formulations and algorithm for the train timetabling problem with dynamic demand.

Eva Barrena, David Canca, Leandro C. Coelho, Gilbert Laporte

Comput. Oper. Res., 2014

The dynamic multiperiod vehicle routing problem with probabilistic information.

Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte

Comput. Oper. Res., 2014

Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints.

Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa, Federico Perea

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Heuristics for the Vehicle Routing Problem.

Gilbert Laporte, Stefan Ropke, Thibaut Vidal

Proceedings of the Vehicle Routing, 2014

2013

Long-Haul Vehicle Routing and Scheduling with Working Hour Rules.

Marie-Ève Rancourt, Jean-François Cordeau, Gilbert Laporte

Transp. Sci., 2013

Analysis of an exact algorithm for the vessel speed optimization problem.

Lars Magnus Hvattum, Inge Norstad, Kjetil Fagerholt, Gilbert Laporte

Networks, 2013

The orienteering problem with variable profits.

Günes Erdogan, Gilbert Laporte

Networks, 2013

Improved lower bounds and exact algorithm for the capacitated arc routing problem.

Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte

Math. Program., 2013

An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand.

Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte

Oper. Res., 2013

Rich routing problems arising in supply chain management.

Verena Schmid, Karl F. Doerner, Gilbert Laporte

Eur. J. Oper. Res., 2013

Vehicle routing: historical perspective and recent contributions.

Gilbert Laporte, Paolo Toth, Daniele Vigo

EURO J. Transp. Logist., 2013

The synchronized arc and node routing problem: Application to road marking.

M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte

Comput. Oper. Res., 2013

Rapid transit network design for optimal cost and origin-destination demand capture.

Gabriel Gutiérrez-Jarpa, Carlos Obreque, Gilbert Laporte, Vladimir Marianov

Comput. Oper. Res., 2013

The exact solution of several classes of inventory-routing problems.

Leandro C. Coelho, Gilbert Laporte

Comput. Oper. Res., 2013

2012

Robust Inventory Routing Under Demand Uncertainty.

Oguz Solyali, Jean-François Cordeau, Gilbert Laporte

Transp. Sci., 2012

Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels.

Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte

Transp. Sci., 2012

A branch-and-cut algorithm for the preemptive swapping problem.

Charles Bordenave, Michel Gendreau, Gilbert Laporte

Networks, 2012

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows.

Luigi Moccia, Jean-François Cordeau, Gilbert Laporte

J. Oper. Res. Soc., 2012

Automatic aircraft cargo load planning.

Sabine Limbourg, Michaël Schyns, Gilbert Laporte

J. Oper. Res. Soc., 2012

A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem.

Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet

INFORMS J. Comput., 2012

A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.

Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte

INFORMS J. Comput., 2012

A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations.

Aliaksandr Shyshou, Irina Gribkovskaia Sr., Gilbert Laporte, Kjetil Fagerholt

INFOR Inf. Syst. Oper. Res., 2012

The Vehicle Routing Problem with Stochastic Demands and Split Deliveries.

Hongtao Lei, Gilbert Laporte, Bo Guo

INFOR Inf. Syst. Oper. Res., 2012

A comparison of three metaheuristics for the workover rig routing problem.

Glaydston Mattos Ribeiro, Gilbert Laporte, Geraldo Regis Mauri

Eur. J. Oper. Res., 2012

The undirected m-Capacitated Peripatetic Salesman Problem.

Éric Duchêne, Gilbert Laporte, Frédéric Semet

Eur. J. Oper. Res., 2012

An adaptive large neighborhood search heuristic for the Pollution-Routing Problem.

Emrah Demir, Tolga Bektas, Gilbert Laporte

Eur. J. Oper. Res., 2012

Districting for routing with stochastic customers.

Hongtao Lei, Gilbert Laporte, Bo Guo

EURO J. Transp. Logist., 2012

Synchronized arc routing for snow plowing operations.

M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte

Comput. Oper. Res., 2012

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem.

Glaydston Mattos Ribeiro, Gilbert Laporte

Comput. Oper. Res., 2012

The Traveling Salesman Problem with Draft Limits.

Jørgen Glomvik Rakke, Marielle Christiansen, Kjetil Fagerholt, Gilbert Laporte

Comput. Oper. Res., 2012

Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.

Günes Erdogan, Maria Battarra, Gilbert Laporte, Daniele Vigo

Comput. Oper. Res., 2012

The inventory-routing problem with transshipment.

Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte

Comput. Oper. Res., 2012

2011

The Dynamic Uncapacitated Hub Location Problem.

Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte

Transp. Sci., 2011

Modeling and solving a multimodal transportation problem with flexible-time and scheduled services.

Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini

Networks, 2011

The preemptive swapping problem on a tree.

Shoshana Anily, Michel Gendreau, Gilbert Laporte

Networks, 2011

Benders Decomposition for Large-Scale Uncapacitated Hub Location.

Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte

Oper. Res., 2011

Designing New Electoral Districts for the City of Edmonton.

Burçin Bozkaya, Erhan Erkut, Dan Haight, Gilbert Laporte

Interfaces, 2011

Optimizing yard assignment in an automotive transshipment terminal.

Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino

Eur. J. Oper. Res., 2011

Stochastic uncapacitated hub location.

Iván A. Contreras, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2011

An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays.

Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte

Discret. Appl. Math., 2011

A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand.

Alper Ekrem Murat, Vedat Verter, Gilbert Laporte

Comput. Oper. Res., 2011

The capacitated vehicle routing problem with stochastic demands and time windows.

Hongtao Lei, Gilbert Laporte, Bo Guo

Comput. Oper. Res., 2011

Minimum cost path problems with relays.

Gilbert Laporte, Marta M. B. Pascoal

Comput. Oper. Res., 2011

A large neighbourhood search heuristic for ship routing and scheduling with split loads.

Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte

Comput. Oper. Res., 2011

A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants.

Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet

Comput. Oper. Res., 2011

A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem.

Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte

Comput. Oper. Res., 2011

A large neighbourhood search heuristic for the aircraft and passenger recovery problem.

Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin

4OR, 2011

An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes.

M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands.

Gilbert Laporte, Roberto Musmanno, Francesca Vocaturo

Transp. Sci., 2010

The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs.

Maria Battarra, Günes Erdogan, Gilbert Laporte, Daniele Vigo

Transp. Sci., 2010

Scheduling technicians and tasks in a telecommunications company.

Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke

J. Sched., 2010

Dynamic transportation of patients in hospitals.

Alexandre Beaudry, Gilbert Laporte, M. Teresa Melo, Stefan Nickel

OR Spectr., 2010

Preface.

Dominique Feillet, Gilbert Laporte, Frédéric Semet

Networks, 2010

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.

Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González

Networks, 2010

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.

Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte

Math. Program., 2010

A concise guide to the Traveling Salesman Problem.

Gilbert Laporte

J. Oper. Res. Soc., 2010

A tabu search heuristic for ship routing and scheduling.

Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte

J. Oper. Res. Soc., 2010

Reducing fuel emissions by optimizing speed on shipping routes.

Kjetil Fagerholt, Gilbert Laporte, Inge Norstad

J. Oper. Res. Soc., 2010

Scheduling ambulance crews for maximum coverage.

Günes Erdogan, Erhan Erkut, Armann Ingolfsson, Gilbert Laporte

J. Oper. Res. Soc., 2010

Editorial.

Tolga Bektas, Gilbert Laporte

J. Oper. Res. Soc., 2010

Some applications of the generalized vehicle routing problem.

Roberto Baldacci, Enrico Bartolini, Gilbert Laporte

J. Oper. Res. Soc., 2010

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization.

Gilbert Laporte

Int. J. Strateg. Decis. Sci., 2010

Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions.

Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, Francesco Mari

J. Heuristics, 2010

An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions.

Leizer de Lima Pinto, Gilbert Laporte

Eur. J. Oper. Res., 2010

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.

Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, Vladimir Marianov

Eur. J. Oper. Res., 2010

The Attractive Traveling Salesman Problem.

Günes Erdogan, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2010

A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars.

Marie-Claude Bolduc, Gilbert Laporte, Jacques Renaud, Fayez F. Boctor

Eur. J. Oper. Res., 2010

Dynamic pickup and delivery problems.

Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2010

The Delivery Man Problem with time windows.

Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte

Discret. Optim., 2010

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.

Günes Erdogan, Jean-François Cordeau, Gilbert Laporte

Discret. Appl. Math., 2010

The dynamic multi-period vehicle routing problem.

Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen

Comput. Oper. Res., 2010

A continuous analysis framework for the solution of location-allocation problems with dense demand.

Alper Ekrem Murat, Vedat Verter, Gilbert Laporte

Comput. Oper. Res., 2010

Heuristics for the mixed swapping problem.

Charles Bordenave, Michel Gendreau, Gilbert Laporte

Comput. Oper. Res., 2010

2009

Stochastic Vehicle Routing Problems.

François V. Louveaux, Gilbert Laporte

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Fifty Years of Vehicle Routing.

Gilbert Laporte

Transp. Sci., 2009

Guest Editorial - Focused Issue on Freight Transportation.

Teodor Gabriel Crainic, Gilbert Laporte, Vedat Verter

Transp. Sci., 2009

Heuristiques pour le Problème du Vendeur <i>m</i>-Péripatétique.

Éric Duchêne, Gilbert Laporte, Frédéric Semet

RAIRO Oper. Res., 2009

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.

Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte

Networks, 2009

Vehicle routing with cross-docking.

Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte

J. Oper. Res. Soc., 2009

Locational analysis: highlights of growth to maturity.

Honora K. Smith, Gilbert Laporte, Paul R. Harper

J. Oper. Res. Soc., 2009

Locating a metro line in a historical city centre: application to Sevilla.

Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo

J. Oper. Res. Soc., 2009

Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems.

Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte

INFORMS J. Comput., 2009

Locating Satellite Yards in Forestry Operations.

Tuyva Chan, Jean-François Cordeau, Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2009

Integration of operational policies into the design phase of a material handling network.

Ardavan Asef-Vaziri, Gilbert Laporte

Int. J. Adv. Oper. Manag., 2009

Partial integration of frequency allocation within antenna positioning in GSM mobile networks.

Souheyl Touhami, Jean-Marie Bourjolly, Gilbert Laporte

Eur. J. Oper. Res., 2009

Lasso solution strategies for the vehicle routing problem with pickups and deliveries.

Arild Hoff, Irina Gribkovskaia Sr., Gilbert Laporte, Arne Løkketangen

Eur. J. Oper. Res., 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.

Temel Öncan, I. Kuban Altinel, Gilbert Laporte

Comput. Oper. Res., 2009

The pickup and delivery traveling salesman problem with first-in-first-out loading.

Günes Erdogan, Jean-François Cordeau, Gilbert Laporte

Comput. Oper. Res., 2009

The petrol station replenishment problem with time windows.

Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud

Comput. Oper. Res., 2009

The capacity and distance constrained plant location problem.

Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte

Comput. Oper. Res., 2009

Quality of service in dial-a-ride operations.

Julie Paquette, Jean-François Cordeau, Gilbert Laporte

Comput. Ind. Eng., 2009

2008

Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.

Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello

Networks, 2008

A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.

Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello

Networks, 2008

Horizontal cooperation among freight carriers: request allocation and profit sharing.

Marta Anna Krajewska, Herbert Kopfer, Gilbert Laporte, Stefan Ropke, Georges Zaccour

J. Oper. Res. Soc., 2008

A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms.

Irina V. Gribkovskaia, Gilbert Laporte, A. Shlopak

J. Oper. Res. Soc., 2008

An exact algorithm for the petrol station replenishment problem.

Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud

J. Oper. Res. Soc., 2008

Wide area telecommunication network design: application to the Alberta SuperNet.

Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson

J. Oper. Res. Soc., 2008

The maximum return-on-investment plant location problem with market share.

Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic

J. Oper. Res. Soc., 2008

A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers.

Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte

J. Oper. Res. Soc., 2008

A two-level simulated annealing algorithm for efficient dissemination of electronic content.

Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte

J. Oper. Res. Soc., 2008

The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan.

H. Neil Geismar, Gilbert Laporte, Lei Lei, Chelliah Sriskandarajah

INFORMS J. Comput., 2008

Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows.

Vitória Pureza, Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2008

Operational Research: Milestones and Highlights of Canadian Contributions.

Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2008

Special Issue of INFOR in Honour of the 50th Anniversary of the Canadian Operational Research Society.

Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2008

A tabu search heuristic for the generalized minimum spanning tree problem.

Temel Öncan, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2008

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.

Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2008

A heuristic for the multi-period petrol station replenishment problem.

Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud

Eur. J. Oper. Res., 2008

Iterated tabu search for the car sequencing problem.

Jean-François Cordeau, Gilbert Laporte, Federico Pasin

Eur. J. Oper. Res., 2008

The single vehicle routing problem with deliveries and selective pickups.

Irina Gribkovskaia Sr., Gilbert Laporte, Aliaksandr Shyshou

Comput. Oper. Res., 2008

Exact algorithms for the joint object placement and request routing problem in content distribution networks.

Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte

Comput. Oper. Res., 2008

2007

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.

Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza

Transp. Sci., 2007

A tabu search heuristic for the quay crane scheduling problem.

Marcello Sammarra, Jean-François Cordeau, Gilbert Laporte, Maria Flavia Monaco

J. Sched., 2007

The bridges of Königsberg - A historical perspective.

Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte

Networks, 2007

Models and branch-and-cut algorithms for pickup and delivery problems with time windows.

Stefan Ropke, Jean-François Cordeau, Gilbert Laporte

Networks, 2007

Locating a cycle in a transportation or a telecommunications network.

Gilbert Laporte, Inmaculada Rodríguez Martín

Networks, 2007

A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems.

Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte

Networks, 2007

Improvements to the Or-opt heuristic for the symmetric travelling salesman problem.

Gilbert Babin, S. Deneault, Gilbert Laporte

J. Oper. Res. Soc., 2007

The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms.

Éric Duchêne, Gilbert Laporte, Frédéric Semet

Oper. Res., 2007

Erratum to "A Continuous Model for Multistore Competitive Location".

Abdullah Dasci, Gilbert Laporte

Oper. Res., 2007

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.

Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte

INFORMS J. Comput., 2007

Étude comparative de divers modèles pour le problème de transport à la demande.

Julie Paquette, Jean-François Cordeau, Gilbert Laporte

INFOR Inf. Syst. Oper. Res., 2007

Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique.

Ghislain Dubuc, Jean-François Cordeau, Gilbert Laporte, Tolga Bektas

INFOR Inf. Syst. Oper. Res., 2007

Designing delivery districts for the vehicle routing problem with stochastic demands.

Dag Haugland, Sin C. Ho, Gilbert Laporte

Eur. J. Oper. Res., 2007

General solutions to the single vehicle routing problem with pickups and deliveries.

Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte, Martin Vlcek

Eur. J. Oper. Res., 2007

The multi-depot vehicle routing problem with inter-depot routes.

Benoit Crevier, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2007

The service allocation problem at the Gioia Tauro Maritime Terminal.

Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia

Eur. J. Oper. Res., 2007

The network design problem with relays.

Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson

Eur. J. Oper. Res., 2007

A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.

Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond

Eur. J. Oper. Res., 2007

Exact and heuristic procedures for the material handling circular flow path design problem.

Ardavan Asef-Vaziri, Gilbert Laporte, Robert Ortiz

Eur. J. Oper. Res., 2007

Heuristic and lower bound for a stochastic location-routing problem.

Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte

Eur. J. Oper. Res., 2007

The dial-a-ride problem: models and algorithms.

Jean-François Cordeau, Gilbert Laporte

Ann. Oper. Res., 2007

Chapter 6 Vehicle Routing.

Jean-François Cordeau, Gilbert Laporte, Martin W. P. Savelsbergh, Daniele Vigo

Proceedings of the Transportation, 2007

Chapter 7 Transportation on Demand.

Jean-François Cordeau, Gilbert Laporte, Jean-Yves Potvin, Martin W. P. Savelsbergh

Proceedings of the Transportation, 2007

Preface.

Cynthia Barnhart, Gilbert Laporte

Proceedings of the Transportation, 2007

2006

Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic.

Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte

Transp. Sci., 2006

A Tabu Search Algorithm for a Routing and Container Loading Problem.

Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello

Transp. Sci., 2006

Solving a vehicle-routing problem arising in soft-drink distribution.

J. Privé, Jacques Renaud, Fayez F. Boctor, Gilbert Laporte

J. Oper. Res. Soc., 2006

The maximal expected coverage relocation problem for emergency vehicles.

Michel Gendreau, Gilbert Laporte, Frédéric Semet

J. Oper. Res. Soc., 2006

The Black and White Traveling Salesman Problem.

Gianpaolo Ghiani, Gilbert Laporte, Frédéric Semet

Oper. Res., 2006

A Memetic Heuristic for the Generalized Quadratic Assignment Problem.

Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia

INFORMS J. Comput., 2006

Designing an efficient method for tandem AGV network design problem using tabu search.

Gilbert Laporte, Reza Zanjirani Farahani, Elnaz Miandoabchi

Appl. Math. Comput., 2006

2005

Models and Tabu Search Heuristics for the Berth-Allocation Problem.

Jean-François Cordeau, Gilbert Laporte, Pasquale Legato, Luigi Moccia

Transp. Sci., 2005

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem.

Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno

Networks, 2005

An analytical approach to the facility location and capacity acquisition problem under demand uncertainty.

Abdullah Dasci, Gilbert Laporte

J. Oper. Res. Soc., 2005

Maximizing the value of an Earth observation satellite orbit.

Jean-François Cordeau, Gilbert Laporte

J. Oper. Res. Soc., 2005

A Continuous Model for Multistore Competitive Location.

Abdullah Dasci, Gilbert Laporte

Oper. Res., 2005

Locating median cycles in networks.

Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González

Eur. J. Oper. Res., 2005

Branch-and-cut algorithms for the undirected m.

Éric Duchêne, Gilbert Laporte, Frédéric Semet

Eur. J. Oper. Res., 2005

Loop based facility planning and material handling.

Ardavan Asef-Vaziri, Gilbert Laporte

Eur. J. Oper. Res., 2005

Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment.

Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Ignacio Sevillano

Ann. Oper. Res., 2005

Foreword.

Horst A. Eiselt, Gilbert Laporte, Vedat Verter

Ann. Oper. Res., 2005

2004

A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem.

Richa Agarwal, Ravindra K. Ahuja, Gilbert Laporte, Zuo-Jun Max Shen

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem.

Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte

Parallel Comput., 2004

Book review.

Gilbert Laporte

Oper. Res. Lett., 2004

The Ring Star Problem: Polyhedral analysis and exact algorithm.

Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González

Networks, 2004

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.

Corinne Feremans, Martine Labbé, Gilbert Laporte

Networks, 2004

Efficient heuristics for Median Cycle Problems.

Jacques Renaud, Fayez F. Boctor, Gilbert Laporte

J. Oper. Res. Soc., 2004

A general multi-shift scheduling system.

Gilbert Laporte, Gilles Pesant

J. Oper. Res. Soc., 2004

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows.

Jean-François Cordeau, Gilbert Laporte, Anne Mercier

J. Oper. Res. Soc., 2004

Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions.

Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno

J. Math. Model. Algorithms, 2004

A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem.

Imdat Kara, Gilbert Laporte, Tolga Bektas

Eur. J. Oper. Res., 2004

Solving the hierarchical Chinese postman problem as a rural postman problem.

Edgar Alberto Cabral, Michel Gendreau, Gianpaolo Ghiani, Gilbert Laporte

Eur. J. Oper. Res., 2004

Heuristics and lower bounds for the bin packing problem with conflicts.

Michel Gendreau, Gilbert Laporte, Frédéric Semet

Comput. Oper. Res., 2004

An Integrated Methodology for the Rapid Transit Network Design Problem.

Gilbert Laporte, Ángel Marín, Juan A. Mesa, Francisco A. Ortega

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003

Scheduling and Lot Streaming in Flowshops with No-Wait in Process.

Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah

J. Sched., 2003

Parallel computing in logistics.

Gilbert Laporte, Roberto Musmanno

Parallel Comput., 2003

Solving a home-care districting problem in an urban setting.

M. Blais, Sophie D. Lapierre, Gilbert Laporte

J. Oper. Res. Soc., 2003

Exact solution of the generalized routing problem through graph transformations.

M. Blais, Gilbert Laporte

J. Oper. Res. Soc., 2003

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.

Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González

Oper. Res., 2003

Upper bounds and algorithms for the maximum cardinality bin packing problem.

Martine Labbé, Gilbert Laporte, Silvano Martello

Eur. J. Oper. Res., 2003

Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.

Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno

Eur. J. Oper. Res., 2003

Generalized network design problems.

Corinne Feremans, Martine Labbé, Gilbert Laporte

Eur. J. Oper. Res., 2003

Ambulance location and relocation models.

Luce Brotcorne, Gilbert Laporte, Frédéric Semet

Eur. J. Oper. Res., 2003

A tabu search heuristic and adaptive memory procedure for political districting.

Burçin Bozkaya, Erhan Erkut, Gilbert Laporte

Eur. J. Oper. Res., 2003

Heuristics for the black and white traveling salesman problem.

Mélanie Bourgeois, Gilbert Laporte, Frédéric Semet

Comput. Oper. Res., 2003

Heuristics for the traveling purchaser problem.

Fayez F. Boctor, Gilbert Laporte, Jacques Renaud

Comput. Oper. Res., 2003

The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms.

Jean-François Cordeau, Gilbert Laporte

4OR, 2003

2002

A comparative analysis of several formulations for the generalized minimum spanning tree problem.

Corinne Feremans, Martine Labbé, Gilbert Laporte

Networks, 2002

Some applications of the clustered travelling salesman problem.

Gilbert Laporte, Udatta S. Palekar

J. Oper. Res. Soc., 2002

A guide to vehicle routing heuristics.

Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet

J. Oper. Res. Soc., 2002

A simple enhancement of the Esau-Williams heuristic for the capacitated minimum spanning tree problem.

Giuseppe Bruno, Gilbert Laporte

J. Oper. Res. Soc., 2002

An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands.

Gilbert Laporte, François V. Louveaux, Luc van Hamme

Oper. Res., 2002

An exact algorithm for the maximum k-club problem in an undirected graph.

Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant

Eur. J. Oper. Res., 2002

Perturbation heuristics for the pickup and delivery traveling salesman problem.

Jacques Renaud, Fayez F. Boctor, Gilbert Laporte

Comput. Oper. Res., 2002

Locating stations on rapid transit lines.

Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega

Comput. Oper. Res., 2002

A heuristic for the location of a rapid transit line.

Giuseppe Bruno, Michel Gendreau, Gilbert Laporte

Comput. Oper. Res., 2002

Fast heuristics for large scale covering-location problems.

Luce Brotcorne, Gilbert Laporte, Frédéric Semet

Comput. Oper. Res., 2002

On the (<i>r</i>|<i>X</i>_<i>p</i>)-Medianoid Problem on a Network with Vertex and Edge Demands.

Abdullah Dasci, Horst A. Eiselt, Gilbert Laporte

Ann. Oper. Res., 2002

Classical Heuristics for the Capacitated VRP.

Gilbert Laporte, Frédéric Semet

Proceedings of the Vehicle Routing Problem., 2002

Metaheuristics for the Capacitated VRP.

Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin

Proceedings of the Vehicle Routing Problem., 2002

2001

A dynamic model and parallel tabu search heuristic for real-time ambulance relocation.

Michel Gendreau, Gilbert Laporte, Frédéric Semet

Parallel Comput., 2001

The capacitated arc routing problem with intermediate facilities.

Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte

Networks, 2001

A unified tabu search heuristic for vehicle routing problems with time windows.

Jean-François Cordeau, Gilbert Laporte, Anne Mercier

J. Oper. Res. Soc., 2001

Solving arc routing problems with turn penalties.

Jacinthe Clossey, Gilbert Laporte, Patrick Soriano

J. Oper. Res. Soc., 2001

A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times.

Michel Gendreau, Gilbert Laporte, Eduardo Morais Guimarães

Eur. J. Oper. Res., 2001

On generalized minimum spanning trees.

Corinne Feremans, Martine Labbé, Gilbert Laporte

Eur. J. Oper. Res., 2001

Preface.

Martine Labbé, Gilbert Laporte, Silvano Martello

Discret. Appl. Math., 2001

2000

A branch-and-cut algorithm for the Undirected Rural Postman Problem.

Gianpaolo Ghiani, Gilbert Laporte

Math. Program., 2000

A Tabu Search Heuristic for the Capacitated Arc Routing Problem.

Alain Hertz, Gilbert Laporte, Michel Mittaz

Oper. Res., 2000

The Uncapacitated Facility Location Problem with Client Matching.

Éric Gourdin, Martine Labbé, Gilbert Laporte

Oper. Res., 2000

Optimization methods for the planning of rapid transit systems.

Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega

Eur. J. Oper. Res., 2000

Heuristics for the multi-vehicle covering tour problem.

Mondher Hachicha, M. John Hodgson, Gilbert Laporte, Frédéric Semet

Comput. Oper. Res., 2000

Heuristics for finding <i>k</i>-clubs in an undirected graph.

Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant

Comput. Oper. Res., 2000

1999

The Swapping Problem on a Line.

Shoshana Anily, Michel Gendreau, Gilbert Laporte

SIAM J. Comput., 1999

Eulerian location problems.

Gianpaolo Ghiani, Gilbert Laporte

Networks, 1999

An emergency vehicle dispatching system for an electric utility in Chile.

Andrés Weintraub, Julio Aboud, Claudio Fernández, Gilbert Laporte, Enrique Ramírez

J. Oper. Res. Soc., 1999

The art and science of designing rotating schedules.

Gilbert Laporte

J. Oper. Res. Soc., 1999

Improvement Procedures for the Undirected Rural Postman Problem.

Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo

INFORMS J. Comput., 1999

An optimality cut for mixed integer linear programs.

Gilbert Laporte, Frédéric Semet

Eur. J. Oper. Res., 1999

The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut.

Corinne Feremans, Martine Labbé, Gilbert Laporte

Electron. Notes Discret. Math., 1999

Heuristics for the traveling salesman problem with pickup and delivery.

Michel Gendreau, Gilbert Laporte, Daniele Vigo

Comput. Oper. Res., 1999

A tabu search heuristic for the heterogeneous fleet vehicle routing problem.

Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard

Comput. Oper. Res., 1999

1998

A branch-and-cut algorithm for the undirected selective traveling salesman problem.

Michel Gendreau, Gilbert Laporte, Frédéric Semet

Networks, 1998

A tiling and routing heuristic for the screening of cytological samples.

Gilbert Laporte, Frédéric Semet, V. V. Dadeshidze, L. J. Olsson

J. Oper. Res. Soc., 1998

Scheduling linen deliveries in a large hospital.

M. Banerjea-Brodeur, Jean-François Cordeau, Gilbert Laporte, A. Lasry

J. Oper. Res. Soc., 1998

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.

Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan

Oper. Res., 1998

A tabu search heuristic for the undirected selective travelling salesman problem.

Michel Gendreau, Gilbert Laporte, Frédéric Semet

Eur. J. Oper. Res., 1998

Covering a graph with cycles.

Martine Labbé, Gilbert Laporte, Patrick Soriano

Comput. Oper. Res., 1998

1997

A combinatorial column generation algorithm for the maximum stable set problem.

Jean-Marie Bourjolly, Gilbert Laporte, Hélène Mercure

Oper. Res. Lett., 1997

A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem.

Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman

Networks, 1997

A tabu search heuristic for periodic and multi-depot vehicle routing problems.

Jean-François Cordeau, Michel Gendreau, Gilbert Laporte

Networks, 1997

The Covering Tour Problem.

Michel Gendreau, Gilbert Laporte, Frédéric Semet

Oper. Res., 1997

An Approximation Algorithm for the Traveling Salesman Problem with Backhauls.

Michel Gendreau, Gilbert Laporte, Alain Hertz

Oper. Res., 1997

A tabu search heuristic using genetic diversification for the clustered traveling salesman problem.

Gilbert Laporte, Jean-Yves Potvin, Florence Quilleret

J. Heuristics, 1997

Modeling and solving several classes of arc routing problems as traveling salesman problems.

Gilbert Laporte

Comput. Oper. Res., 1997

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.

Bruce L. Golden, Gilbert Laporte, Éric D. Taillard

Comput. Oper. Res., 1997

Recent Developments in Practical Course Timetabling.

Michael W. Carter, Gilbert Laporte

Proceedings of the Practice and Theory of Automated Timetabling II, 1997

1996

Optimal Location of Facilities on a Network with an Unreliable Node or Link.

Horst A. Eiselt, Michel Gendreau, Gilbert Laporte

Inf. Process. Lett., 1996

The Plant Location Problem: New Models and Research Prospects.

Charles S. Revelle, Gilbert Laporte

Oper. Res., 1996

A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers.

Michel Gendreau, Gilbert Laporte, René Séguin

Oper. Res., 1996

A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem.

Jacques Renaud, Fayez F. Boctor, Gilbert Laporte

INFORMS J. Comput., 1996

A tabu search heuristic for the multi-depot vehicle routing problem.

Jacques Renaud, Gilbert Laporte, Fayez F. Boctor

Comput. Oper. Res., 1996

The Traveling Salesman Problem with Backhauls.

Michel Gendreau, Alain Hertz, Gilbert Laporte

Comput. Oper. Res., 1996

Metaheuristics: A bibliography.

Ibrahim H. Osman, Gilbert Laporte

Ann. Oper. Res., 1996

Foreword.

Gilbert Laporte, Ibrahim H. Osman

Ann. Oper. Res., 1996

1995

An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers.

Michel Gendreau, Gilbert Laporte, René Séguin

Transp. Sci., 1995

Single-Vehicle Routing and Scheduling to Minimize the Number of Delays.

Michel Gendreau, Gilbert Laporte, Marius M. Solomon

Transp. Sci., 1995

The <i>m</i>-Traveling Salesman Problem with Minmax Objective.

Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller

Transp. Sci., 1995

Efficient heuristics for the design of ring networks.

Michel Gendreau, Martine Labbé, Gilbert Laporte

Telecommun. Syst., 1995

An exact algorithm for the dual bin packing problem.

Martine Labbé, Gilbert Laporte, Silvano Martello

Oper. Res. Lett., 1995

Arc Routing Problems, Part II: The Rural Postman Problem.

Horst A. Eiselt, Michel Gendreau, Gilbert Laporte

Oper. Res., 1995

Arc Routing Problems, Part I: The Chinese Postman Problem.

Horst A. Eiselt, Michel Gendreau, Gilbert Laporte

Oper. Res., 1995

Routing problems: A bibliography.

Gilbert Laporte, Ibrahim H. Osman

Ann. Oper. Res., 1995

Foreword.

Michel Gendreau, Gilbert Laporte

Ann. Oper. Res., 1995

Recent Developments in Practical Examination Timetabling.

Michael W. Carter, Gilbert Laporte

Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995

1994

Exact Solution to a Location Problem with Stochastic Demands.

Gilbert Laporte, François V. Louveaux, Luc van Hamme

Transp. Sci., 1994

A Priori Optimization of the Probabilistic Traveling Salesman Problem.

Gilbert Laporte, François V. Louveaux, Hélène Mercure

Oper. Res., 1994

Vehicle routing with split deliveries.

Moshe Dror, Gilbert Laporte, Pierre Trudeau

Discret. Appl. Math., 1994

A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective.

Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller

Comput. Oper. Res., 1994

1993

Competitive Location Models: A Framework and Bibliography.

Horst A. Eiselt, Gilbert Laporte, Jacques-François Thisse

Transp. Sci., 1993

The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree.

Horst A. Eiselt, Gilbert Laporte

Transp. Sci., 1993

The integer L-shaped method for stochastic integer programs with complete recourse.

Gilbert Laporte, François V. Louveaux

Oper. Res. Lett., 1993

Vehicle routing with stochastic demands and restricted failures.

Moshe Dror, Gilbert Laporte, François V. Louveaux

ZOR Methods Model. Oper. Res., 1993

The Delivery Man Problem and Cumulative Matroids.

Matteo Fischetti, Gilbert Laporte, Silvano Martello

Oper. Res., 1993

Designing collection routes through bank branches.

Véronique Lambert, Gilbert Laporte, François V. Louveaux

Comput. Oper. Res., 1993

An exact quadratic 0-1 algorithm for the stable set problem.

Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure

Proceedings of the Cliques, 1993

1992

The Vehicle Routing Problem with Stochastic Travel Times.

Gilbert Laporte, François V. Louveaux, Hélène Mercure

Transp. Sci., 1992

Selected Abstracts for the 1990-1991 Transportation Science Section Dissertation Prize Competition.

Gilbert Laporte

Transp. Sci., 1992

Location of facilities on a network subject to a single-edge failure.

Horst A. Eiselt, Michel Gendreau, Gilbert Laporte

Networks, 1992

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.

Michel Gendreau, Alain Hertz, Gilbert Laporte

Oper. Res., 1992

1991

Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.

Martin Desrochers, Gilbert Laporte

Oper. Res. Lett., 1991

Capacitated Vehicle Routing on Trees.

Martine Labbé, Gilbert Laporte, Hélène Mercure

Oper. Res., 1991

1990

The selective travelling salesman problem.

Gilbert Laporte, Silvano Martello

Discret. Appl. Math., 1990

1989

Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks.

Moshe Dror, Gilbert Laporte, Pierre Trudeau

Transp. Sci., 1989

1988

Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems.

Gilbert Laporte, Yves Nobert, Serge Taillefer

Transp. Sci., 1988

Vehicle routing with full loads.

Jacques Desrosiers, Gilbert Laporte, Michel Sauvé, François Soumis, Serge Taillefer

Comput. Oper. Res., 1988

1987

Generalized travelling salesman problem through n sets of nodes: the asymmetrical case.

Gilbert Laporte, Hélène Mercure, Yves Nobert

Discret. Appl. Math., 1987

1986

An exact algorithm for the asymmetrical capacitated vehicle routing problem.

Gilbert Laporte, Hélène Mercure, Yves Nobert

Networks, 1986

The problem of assigning students to course sections in a large engineering school.

Gilbert Laporte, Sylvain Desroches

Comput. Oper. Res., 1986

1985

Optimal Routing under Capacity and Distance Restrictions.

Gilbert Laporte, Yves Nobert, Martin Desrochers

Oper. Res., 1985

1984

Two exact algorithms for the distance-constrained vehicle routing problem.

Gilbert Laporte, Martin Desrochers, Yves Nobert

Networks, 1984

Examination timetabling by computer.

Gilbert Laporte, Sylvain Desroches

Comput. Oper. Res., 1984

1975

Permutation Programming: Problems, Methods and Applications.

Gilbert Laporte

PhD thesis, 1975