Polyhedral results for a vehicle routing problem

DOI10.1016/0377-2217(91)90337-UzbMath0744.90027OpenAlexW2072550287MaRDI QIDQ1176821

Enrique Mota, Vicente Campos, Angel Corberán

Publication date: 25 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90337-u

zbMATH Keywords

vehicle routingfacial structuresubtour elimination0-1 linear programmingcomplete, undirected graph

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm ⋮ Solution algorithms for synchronous flow shop problems with two dominating machines ⋮ Routing problems: A bibliography ⋮ Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ A result on projection for the vehicle routing problem ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ The Split Delivery Vehicle Routing Problem: A Survey ⋮ Polyhedral study of the capacitated vehicle routing problem ⋮ Unnamed Item

Uses Software

• VRP

Cites Work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A classification scheme for vehicle routing and scheduling problems
• Matching theory
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• On the symmetric travelling salesman problem I: Inequalities
• Two exact algorithms for the distance-constrained vehicle routing problem
• Optimal Routing under Capacity and Distance Restrictions
• Implementing vehicle routing algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item