Gilbert Laporte

42 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0003-0869-1507

School of Management, University of Bath, Bath BA2 7AY, United Kingdom

Publications

• A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves — Operations Research 2024
• How to operate ship fleets under uncertainty — Production and Operations Management 2023
• Optimal Picking Policies in E-Commerce Warehouses — Management Science 2022
• Single Allocation Hub Location with Heterogeneous Economies of Scale — Operations Research 2022
• A Cost-Sharing Mechanism for Multi-Country Partnerships in Disaster Preparedness — Production and Operations Management 2021
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints — INFORMS Journal on Computing 2020
• Collaborative Prepositioning Network Design for Regional Disaster Response — Production and Operations Management 2019 (name-matched, not ORCID-linked)
• Exact Solution of the Evasive Flow Capturing Problem — Operations Research 2018
• Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location — INFORMS Journal on Computing 2017
• The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty — Management Science 2016
• Districting for Arc Routing — INFORMS Journal on Computing 2014
• An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand — Operations Research 2013
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem — INFORMS Journal on Computing 2012
• A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem — INFORMS Journal on Computing 2012
• Benders Decomposition for Large-Scale Uncapacitated Hub Location — Operations Research 2011
• Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems — INFORMS Journal on Computing 2009
• The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan — INFORMS Journal on Computing 2008
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading — INFORMS Journal on Computing 2007
• The Undirectedm-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms — Operations Research 2007
• Erratum to “A Continuous Model for Multistore Competitive Location” — Operations Research 2007
• A Memetic Heuristic for the Generalized Quadratic Assignment Problem — INFORMS Journal on Computing 2006
• The Black and White Traveling Salesman Problem — Operations Research 2006
• A Continuous Model for Multistore Competitive Location — Operations Research 2005
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem — Operations Research 2003
• An IntegerL-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands — Operations Research 2002
• The Uncapacitated Facility Location Problem with Client Matching — Operations Research 2000
• A Tabu Search Heuristic for the Capacitated arc Routing Problem — Operations Research 2000
• Improvement Procedures for the Undirected Rural Postman Problem — INFORMS Journal on Computing 1999
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows — Operations Research 1998
• The Covering Tour Problem — Operations Research 1997
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls — Operations Research 1997
• The Plant Location Problem: New Models and Research Prospects — Operations Research 1996
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem — INFORMS Journal on Computing 1996
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers — Operations Research 1996
• Arc Routing Problems, Part II: The Rural Postman Problem — Operations Research 1995
• Arc Routing Problems, Part I: The Chinese Postman Problem — Operations Research 1995
• A Tabu Search Heuristic for the Vehicle Routing Problem — Management Science 1994
• A Priori Optimization of the Probabilistic Traveling Salesman Problem — Operations Research 1994
• The Delivery Man Problem and Cumulative Matroids — Operations Research 1993 (name-matched, not ORCID-linked)
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem — Operations Research 1992 (name-matched, not ORCID-linked)
• Capacitated Vehicle Routing on Trees — Operations Research 1991
• Optimal Routing under Capacity and Distance Restrictions — Operations Research 1985