Gilbert Laporte

According to our database1, Gilbert Laporte authored at least 365 papers between 1975 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Vehicle Routing and Location Routing with Intermediate Stops: A Review.
Transportation Science, 2019

An Exact Algorithm for Multilevel Uncapacitated Facility Location.
Transportation Science, 2019

Exact Solution of Several Families of Location-Arc Routing Problems.
Transportation Science, 2019

The electric vehicle routing problem with shared charging stations.
ITOR, 2019

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

The Steiner Traveling Salesman Problem and its extensions.
European Journal of Operational Research, 2019

An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows.
European Journal of Operational Research, 2019

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

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

Integrated planning of ship deployment, service schedule and container routing.
Computers & OR, 2019

A vehicle routing problem arising in unmanned aerial monitoring.
Computers & OR, 2019

A districting-based heuristic for the coordinated capacitated arc routing problem.
Computers & OR, 2019

A two-echelon inventory routing problem for perishable products.
Computers & OR, 2019

The green mixed fleet vehicle routing problem with partial battery recharging and time windows.
Computers & OR, 2019

Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations.
Computers & OR, 2019

Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions.
Computers & OR, 2019

Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer.
Computers & OR, 2019

Median and covering location problems with interconnected facilities.
Computers & OR, 2019

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

A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem.
Transportation Science, 2018

A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem.
Transportation Science, 2018

The Chinese Postman Problem with Load-Dependent Costs.
Transportation Science, 2018

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

Long-haul vehicle routing and scheduling with idling options.
JORS, 2018

Exact Solution of the Evasive Flow Capturing Problem.
Operations Research, 2018

Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities.
European Journal of Operational Research, 2018

Multi-level facility location problems.
European Journal of Operational Research, 2018

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times.
European Journal of Operational Research, 2018

The static bike relocation problem with multiple vehicles and visits.
European Journal of Operational Research, 2018

Route and speed optimization for autonomous trucks.
Computers & OR, 2018

Vehicle routing with backhauls: Review and research perspectives.
Computers & OR, 2018

The periodic supply vessel planning problem with flexible departure times and coupled vessels.
Computers & OR, 2018

An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling.
Computers & OR, 2018

Corridor-based metro network design with travel flow capture.
Computers & OR, 2018

Shared mobility systems: an updated survey.
Annals OR, 2018

2017
The railway line frequency and size setting problem.
Public Transport, 2017

Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location.
INFORMS Journal on Computing, 2017

Resource constrained routing and scheduling: Review and research prospects.
European Journal of Operational Research, 2017

A metaheuristic for the time-dependent pollution-routing problem.
European Journal of Operational Research, 2017

Scheduling identical parallel machines with tooling constraints.
European Journal of Operational Research, 2017

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs.
Computers & OR, 2017

The pickup and delivery problem with time windows and handling operations.
Computers & OR, 2017

A branch-and-cut algorithm for the minimum branch vertices spanning tree problem.
Computers & OR, 2017

A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints.
Computers & OR, 2017

Vehicle routing with cross-dock selection.
Computers & OR, 2017

An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time.
Computers & OR, 2017

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

Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms.
Computers & OR, 2017

An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem.
Computers & OR, 2017

Planning a selective delivery schedule through Adaptive Large Neighborhood Search.
Computers & Industrial Engineering, 2017

The multi-vehicle cumulative covering tour problem.
Annals OR, 2017

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

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

The Rainbow Cycle Cover Problem.
Networks, 2016

Counting and enumerating feasible rotating schedules by means of Gröbner bases.
Mathematics and Computers in Simulation, 2016

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

The traveling salesman problem with time-dependent service times.
European Journal of Operational Research, 2016

Large neighborhood search for multi-trip vehicle routing.
European Journal of Operational Research, 2016

Thirty years of heterogeneous vehicle routing.
European Journal of Operational Research, 2016

The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm.
European Journal of Operational Research, 2016

An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem.
European Journal of Operational Research, 2016

Exact and heuristic algorithms for the Hamiltonian p-median problem.
European Journal of Operational Research, 2016

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.
European Journal of Operational Research, 2016

A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem.
Computers & OR, 2016

A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand.
Computers & OR, 2016

An adaptive large neighborhood search for the discrete and continuous Berth allocation problem.
Computers & OR, 2016

Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm.
Computers & OR, 2016

Berth allocation in an ore terminal with demurrage, despatch and maintenance.
Computers & Industrial Engineering, 2016

Scheduling issues in vehicle routing.
Annals OR, 2016

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

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

2015
Scheduling Twin Yard Cranes in a Container Block.
Transportation Science, 2015

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

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

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

Multi-level facility location as the maximization of a submodular set function.
European Journal of Operational Research, 2015

Classification, models and exact algorithms for multi-compartment delivery problems.
European Journal of Operational Research, 2015

The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations.
Discrete Applied Mathematics, 2015

Tactical network planning for food aid distribution in Kenya.
Computers & OR, 2015

Dynamic design of sales territories.
Computers & OR, 2015

Path based algorithms for metro network design.
Computers & OR, 2015

A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows.
Computers & OR, 2015

Model-based automatic neighborhood design by unsupervised learning.
Computers & OR, 2015

A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading.
Computers & OR, 2015

Integrated vehicle routing problems.
Computers & OR, 2015

Robust assembly line balancing with heterogeneous workers.
Computers & Industrial Engineering, 2015

Shared mobility systems.
4OR, 2015

A Combined Liquefied Natural Gas Routing and Deteriorating Inventory Management Problem.
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).
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.
Transportation Science, 2014

Thirty Years of Inventory Routing.
Transportation Science, 2014

A comparison of several models for the hamiltonian p-median problem.
Networks, 2014

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

A comparison of several enumerative algorithms for Sudoku.
JORS, 2014

Districting for Arc Routing.
INFORMS Journal on Computing, 2014

The Tube Challenge.
INFOR, 2014

Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem.
European Journal of Operational Research, 2014

The static bicycle relocation problem with demand intervals.
European Journal of Operational Research, 2014

A review of recent research on green road freight transportation.
European Journal of Operational Research, 2014

The bi-objective Pollution-Routing Problem.
European Journal of Operational Research, 2014

Partial-route inequalities for the multi-vehicle routing problem with stochastic demands.
Discrete Applied Mathematics, 2014

The multi-district team orienteering problem.
Computers & OR, 2014

Optimal joint replenishment, delivery and inventory management policies for perishable products.
Computers & OR, 2014

Heuristics for dynamic and stochastic inventory-routing.
Computers & OR, 2014

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.
Computers & OR, 2014

Exact formulations and algorithm for the train timetabling problem with dynamic demand.
Computers & OR, 2014

The dynamic multiperiod vehicle routing problem with probabilistic information.
Computers & OR, 2014

Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Heuristics for the Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

2013
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules.
Transportation Science, 2013

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

The orienteering problem with variable profits.
Networks, 2013

Improved lower bounds and exact algorithm for the capacitated arc routing problem.
Math. Program., 2013

An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand.
Operations Research, 2013

Rich routing problems arising in supply chain management.
European Journal of Operational Research, 2013

Vehicle routing: historical perspective and recent contributions.
EURO J. Transportation and Logistics, 2013

The synchronized arc and node routing problem: Application to road marking.
Computers & OR, 2013

Rapid transit network design for optimal cost and origin-destination demand capture.
Computers & OR, 2013

The exact solution of several classes of inventory-routing problems.
Computers & OR, 2013

2012
Robust Inventory Routing Under Demand Uncertainty.
Transportation Science, 2012

Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels.
Transportation Science, 2012

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

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

Automatic aircraft cargo load planning.
JORS, 2012

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

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

The Vehicle Routing Problem with Stochastic Demands and Split Deliveries.
INFOR, 2012

A comparison of three metaheuristics for the workover rig routing problem.
European Journal of Operational Research, 2012

The undirected m-Capacitated Peripatetic Salesman Problem.
European Journal of Operational Research, 2012

An adaptive large neighborhood search heuristic for the Pollution-Routing Problem.
European Journal of Operational Research, 2012

Districting for routing with stochastic customers.
EURO J. Transportation and Logistics, 2012

Synchronized arc routing for snow plowing operations.
Computers & OR, 2012

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem.
Computers & OR, 2012

The Traveling Salesman Problem with Draft Limits.
Computers & OR, 2012

Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.
Computers & OR, 2012

The inventory-routing problem with transshipment.
Computers & OR, 2012

2011
The Dynamic Uncapacitated Hub Location Problem.
Transportation Science, 2011

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

The preemptive swapping problem on a tree.
Networks, 2011

Benders Decomposition for Large-Scale Uncapacitated Hub Location.
Operations Research, 2011

Designing New Electoral Districts for the City of Edmonton.
Interfaces, 2011

Optimizing yard assignment in an automotive transshipment terminal.
European Journal of Operational Research, 2011

Stochastic uncapacitated hub location.
European Journal of Operational Research, 2011

An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays.
Discrete Applied Mathematics, 2011

A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand.
Computers & OR, 2011

The capacitated vehicle routing problem with stochastic demands and time windows.
Computers & OR, 2011

Minimum cost path problems with relays.
Computers & OR, 2011

A large neighbourhood search heuristic for ship routing and scheduling with split loads.
Computers & OR, 2011

A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants.
Computers & OR, 2011

A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem.
Computers & OR, 2011

A large neighbourhood search heuristic for the aircraft and passenger recovery problem.
4OR, 2011

An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes.
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.
Transportation Science, 2010

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

Scheduling technicians and tasks in a telecommunications company.
J. Scheduling, 2010

Dynamic transportation of patients in hospitals.
OR Spectrum, 2010

Preface.
Networks, 2010

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

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

A concise guide to the Traveling Salesman Problem.
JORS, 2010

A tabu search heuristic for ship routing and scheduling.
JORS, 2010

Reducing fuel emissions by optimizing speed on shipping routes.
JORS, 2010

Scheduling ambulance crews for maximum coverage.
JORS, 2010

Editorial.
JORS, 2010

Some applications of the generalized vehicle routing problem.
JORS, 2010

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

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

An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions.
European Journal of Operational Research, 2010

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.
European Journal of Operational Research, 2010

The Attractive Traveling Salesman Problem.
European Journal of Operational Research, 2010

A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars.
European Journal of Operational Research, 2010

Dynamic pickup and delivery problems.
European Journal of Operational Research, 2010

The Delivery Man Problem with time windows.
Discrete Optimization, 2010

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Discrete Applied Mathematics, 2010

The dynamic multi-period vehicle routing problem.
Computers & OR, 2010

A continuous analysis framework for the solution of location-allocation problems with dense demand.
Computers & OR, 2010

Heuristics for the mixed swapping problem.
Computers & OR, 2010

2009
Stochastic Vehicle Routing Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Fifty Years of Vehicle Routing.
Transportation Science, 2009

Guest Editorial - Focused Issue on Freight Transportation.
Transportation Science, 2009

Heuristiques pour le Problème du Vendeur m-Péripatétique.
RAIRO - Operations Research, 2009

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

Vehicle routing with cross-docking.
JORS, 2009

Locational analysis: highlights of growth to maturity.
JORS, 2009

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

Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems.
INFORMS Journal on Computing, 2009

Locating Satellite Yards in Forestry Operations.
INFOR, 2009

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

Partial integration of frequency allocation within antenna positioning in GSM mobile networks.
European Journal of Operational Research, 2009

Lasso solution strategies for the vehicle routing problem with pickups and deliveries.
European Journal of Operational Research, 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.
Computers & OR, 2009

The pickup and delivery traveling salesman problem with first-in-first-out loading.
Computers & OR, 2009

The petrol station replenishment problem with time windows.
Computers & OR, 2009

The capacity and distance constrained plant location problem.
Computers & OR, 2009

Quality of service in dial-a-ride operations.
Computers & Industrial Engineering, 2009

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

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

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

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

An exact algorithm for the petrol station replenishment problem.
JORS, 2008

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

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

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

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

The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan.
INFORMS Journal on Computing, 2008

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

Operational Research: Milestones and Highlights of Canadian Contributions.
INFOR, 2008

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

A tabu search heuristic for the generalized minimum spanning tree problem.
European Journal of Operational Research, 2008

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.
European Journal of Operational Research, 2008

A heuristic for the multi-period petrol station replenishment problem.
European Journal of Operational Research, 2008

Iterated tabu search for the car sequencing problem.
European Journal of Operational Research, 2008

The single vehicle routing problem with deliveries and selective pickups.
Computers & OR, 2008

Exact algorithms for the joint object placement and request routing problem in content distribution networks.
Computers & OR, 2008

2007
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.
Transportation Science, 2007

The bridges of Königsberg - A historical perspective.
Networks, 2007

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

Locating a cycle in a transportation or a telecommunications network.
Networks, 2007

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

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

The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms.
Operations Research, 2007

Erratum to "A Continuous Model for Multistore Competitive Location".
Operations Research, 2007

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
INFORMS Journal on Computing, 2007

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

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

Designing delivery districts for the vehicle routing problem with stochastic demands.
European Journal of Operational Research, 2007

General solutions to the single vehicle routing problem with pickups and deliveries.
European Journal of Operational Research, 2007

The multi-depot vehicle routing problem with inter-depot routes.
European Journal of Operational Research, 2007

The service allocation problem at the Gioia Tauro Maritime Terminal.
European Journal of Operational Research, 2007

The network design problem with relays.
European Journal of Operational Research, 2007

A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
European Journal of Operational Research, 2007

Exact and heuristic procedures for the material handling circular flow path design problem.
European Journal of Operational Research, 2007

Heuristic and lower bound for a stochastic location-routing problem.
European Journal of Operational Research, 2007

The dial-a-ride problem: models and algorithms.
Annals OR, 2007

2006
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic.
Transportation Science, 2006

A Tabu Search Algorithm for a Routing and Container Loading Problem.
Transportation Science, 2006

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

The maximal expected coverage relocation problem for emergency vehicles.
JORS, 2006

The Black and White Traveling Salesman Problem.
Operations Research, 2006

A Memetic Heuristic for the Generalized Quadratic Assignment Problem.
INFORMS Journal on Computing, 2006

Designing an efficient method for tandem AGV network design problem using tabu search.
Applied Mathematics and Computation, 2006

2005
Models and Tabu Search Heuristics for the Berth-Allocation Problem.
Transportation Science, 2005

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

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

Maximizing the value of an Earth observation satellite orbit.
JORS, 2005

A Continuous Model for Multistore Competitive Location.
Operations Research, 2005

Locating median cycles in networks.
European Journal of Operational Research, 2005

Branch-and-cut algorithms for the undirected m.
European Journal of Operational Research, 2005

Loop based facility planning and material handling.
European Journal of Operational Research, 2005

Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment.
Annals OR, 2005

Foreword.
Annals OR, 2005

2004
A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem.
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.
Parallel Computing, 2004

Book review.
Oper. Res. Lett., 2004

The Ring Star Problem: Polyhedral analysis and exact algorithm.
Networks, 2004

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

Efficient heuristics for Median Cycle Problems.
JORS, 2004

A general multi-shift scheduling system.
JORS, 2004

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

Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions.
J. Math. Model. Algorithms, 2004

A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem.
European Journal of Operational Research, 2004

Solving the hierarchical Chinese postman problem as a rural postman problem.
European Journal of Operational Research, 2004

Heuristics and lower bounds for the bin packing problem with conflicts.
Computers & OR, 2004

An Integrated Methodology for the Rapid Transit Network Design Problem.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

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

Parallel computing in logistics.
Parallel Computing, 2003

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

Exact solution of the generalized routing problem through graph transformations.
JORS, 2003

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.
Operations Research, 2003

Upper bounds and algorithms for the maximum cardinality bin packing problem.
European Journal of Operational Research, 2003

Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
European Journal of Operational Research, 2003

Generalized network design problems.
European Journal of Operational Research, 2003

Ambulance location and relocation models.
European Journal of Operational Research, 2003

A tabu search heuristic and adaptive memory procedure for political districting.
European Journal of Operational Research, 2003

Heuristics for the black and white traveling salesman problem.
Computers & OR, 2003

Heuristics for the traveling purchaser problem.
Computers & OR, 2003

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

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

An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands.
Operations Research, 2002

An exact algorithm for the maximum k-club problem in an undirected graph.
European Journal of Operational Research, 2002

Perturbation heuristics for the pickup and delivery traveling salesman problem.
Computers & OR, 2002

Locating stations on rapid transit lines.
Computers & OR, 2002

A heuristic for the location of a rapid transit line.
Computers & OR, 2002

Fast heuristics for large scale covering-location problems.
Computers & OR, 2002

On the (r|Xp)-Medianoid Problem on a Network with Vertex and Edge Demands.
Annals OR, 2002

Classical Heuristics for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002

Metaheuristics for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002

2001
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation.
Parallel Computing, 2001

The capacitated arc routing problem with intermediate facilities.
Networks, 2001

A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times.
European Journal of Operational Research, 2001

On generalized minimum spanning trees.
European Journal of Operational Research, 2001

Preface.
Discrete Applied Mathematics, 2001

2000
A branch-and-cut algorithm for the Undirected Rural Postman Problem.
Math. Program., 2000

A Tabu Search Heuristic for the Capacitated Arc Routing Problem.
Operations Research, 2000

The Uncapacitated Facility Location Problem with Client Matching.
Operations Research, 2000

Optimization methods for the planning of rapid transit systems.
European Journal of Operational Research, 2000

Heuristics for the multi-vehicle covering tour problem.
Computers & OR, 2000

Heuristics for finding k-clubs in an undirected graph.
Computers & OR, 2000

1999
The Swapping Problem on a Line.
SIAM J. Comput., 1999

Eulerian location problems.
Networks, 1999

Improvement Procedures for the Undirected Rural Postman Problem.
INFORMS Journal on Computing, 1999

An optimality cut for mixed integer linear programs.
European Journal of Operational Research, 1999

The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut.
Electronic Notes in Discrete Mathematics, 1999

Heuristics for the traveling salesman problem with pickup and delivery.
Computers & OR, 1999

A tabu search heuristic for the heterogeneous fleet vehicle routing problem.
Computers & OR, 1999

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

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.
Operations Research, 1998

A tabu search heuristic for the undirected selective travelling salesman problem.
European Journal of Operational Research, 1998

Covering a graph with cycles.
Computers & OR, 1998

1997
A combinatorial column generation algorithm for the maximum stable set problem.
Oper. Res. Lett., 1997

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

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

The Covering Tour Problem.
Operations Research, 1997

An Approximation Algorithm for the Traveling Salesman Problem with Backhauls.
Operations Research, 1997

A tabu search heuristic using genetic diversification for the clustered traveling salesman problem.
J. Heuristics, 1997

Modeling and solving several classes of arc routing problems as traveling salesman problems.
Computers & OR, 1997

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.
Computers & OR, 1997

Recent Developments in Practical Course Timetabling.
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.
Inf. Process. Lett., 1996

The Plant Location Problem: New Models and Research Prospects.
Operations Research, 1996

A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers.
Operations Research, 1996

A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem.
INFORMS Journal on Computing, 1996

A tabu search heuristic for the multi-depot vehicle routing problem.
Computers & OR, 1996

The Traveling Salesman Problem with Backhauls.
Computers & OR, 1996

Metaheuristics: A bibliography.
Annals OR, 1996

Foreword.
Annals OR, 1996

1995
An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers.
Transportation Science, 1995

Single-Vehicle Routing and Scheduling to Minimize the Number of Delays.
Transportation Science, 1995

The m-Traveling Salesman Problem with Minmax Objective.
Transportation Science, 1995

Efficient heuristics for the design of ring networks.
Telecommunication Systems, 1995

An exact algorithm for the dual bin packing problem.
Oper. Res. Lett., 1995

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

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

Routing problems: A bibliography.
Annals OR, 1995

Foreword.
Annals OR, 1995

Recent Developments in Practical Examination Timetabling.
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.
Transportation Science, 1994

A Priori Optimization of the Probabilistic Traveling Salesman Problem.
Operations Research, 1994

Vehicle routing with split deliveries.
Discrete Applied Mathematics, 1994

A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective.
Computers & OR, 1994

1993
Competitive Location Models: A Framework and Bibliography.
Transportation Science, 1993

The Existence of Equilibria in the 3-Facility Hotelling Model in a Tree.
Transportation Science, 1993

The integer L-shaped method for stochastic integer programs with complete recourse.
Oper. Res. Lett., 1993

Vehicle routing with stochastic demands and restricted failures.
ZOR - Meth. & Mod. of OR, 1993

The Delivery Man Problem and Cumulative Matroids.
Operations Research, 1993

Designing collection routes through bank branches.
Computers & OR, 1993

An exact quadratic 0-1 algorithm for the stable set problem.
Proceedings of the Cliques, 1993

1992
The Vehicle Routing Problem with Stochastic Travel Times.
Transportation Science, 1992

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

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

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.
Operations Research, 1992

1991
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.
Oper. Res. Lett., 1991

Capacitated Vehicle Routing on Trees.
Operations Research, 1991

1990
The selective travelling salesman problem.
Discrete Applied Mathematics, 1990

1989
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks.
Transportation Science, 1989

1988
Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems.
Transportation Science, 1988

Vehicle routing with full loads.
Computers & OR, 1988

1987
Generalized travelling salesman problem through n sets of nodes: the asymmetrical case.
Discrete Applied Mathematics, 1987

1986
An exact algorithm for the asymmetrical capacitated vehicle routing problem.
Networks, 1986

The problem of assigning students to course sections in a large engineering school.
Computers & OR, 1986

1985
Optimal Routing under Capacity and Distance Restrictions.
Operations Research, 1985

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

Examination timetabling by computer.
Computers & OR, 1984

1975
Permutation Programming: Problems, Methods and Applications.
PhD thesis, 1975


  Loading...