Combined route capacity and route length models for unit demand vehicle routing problems

DOI10.1016/j.disopt.2007.05.001zbMath1168.90359MaRDI QIDQ951110

Luís Gouveia, Thomas L. Magnanti, Maria Teresa Godinho

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.05.001

zbMATH Keywords

travelling salesman problem; vehicle routing problem; Hop-indexed network flow models

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90B20: Traffic problems in operations research

Related Items

Further contributions to network optimization, Combined route capacity and route length models for unit demand vehicle routing problems

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of travelling salesman problem formulations
• Combined route capacity and route length models for unit demand vehicle routing problems
• A result on projection for the vehicle routing problem
• Polyhedral results for a vehicle routing problem
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• A branch-and-cut algorithm for vehicle routing problems
• Multistars, partial multistars and the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• A New Formulation for the Travelling Salesman Problem
• Facets of the Asymmetric Traveling Salesman Polytope
• A Polyhedral Intersection Theorem for Capacitated Spanning Trees
• The Fixed-Outdegree 1-Arborescence Polytope
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Solution of a Large-Scale Traveling-Salesman Problem
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints