A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems

DOI10.1287/IJOC.7.1.1MaRDI QIDQ4835444zbMATH OpenOpenAlexFDO

Authors Donald L. Miller

Publication date 9 October 1995

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.7.1.1

zbMATH Keywords

branch-and-boundcapacitated vehicle routingLagrange multipliersperfect \(b\)-matching

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• Integer Programming and Combinatorial Optimization
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

Cited in

(11)

• Stronger K-tree relaxations for the vehicle routing problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• Routing problems: A bibliography
• Minimum cost b-matching problems with neighborhoods
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
• Decomposition and dynamic cut generation in integer linear programming
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Integer Programming and Combinatorial Optimization
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Exact algorithms for routing problems under vehicle capacity constraints

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835444)