A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
From MaRDI portal
Publication:4835444
DOI10.1287/ijoc.7.1.1zbMath0822.90057MaRDI QIDQ4835444
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
90B06: Transportation, logistics and supply chain management
Related Items
Models, relaxations and exact approaches for the capacitated vehicle routing problem, Stronger \(K\)-tree relaxations for the vehicle routing problem, Routing problems: A bibliography, 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
Uses Software