A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems

DOI10.1287/ijoc.7.1.1zbMath0822.90057OpenAlexW2137460743MaRDI QIDQ4835444

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

Lagrange multipliersbranch-and-boundcapacitated vehicle routingperfect \(b\)-matching

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (7)

Routing problems: A bibliography ⋮ Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ Minimum cost \(b\)-matching problems with neighborhoods

Uses Software

• TSPLIB

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