Vehicle routing with subtours
From MaRDI portal
Publication:2010917
DOI10.1016/j.disopt.2019.03.003zbMath1474.90378arXiv1801.04991OpenAlexW2962997605WikidataQ128135279 ScholiaQ128135279MaRDI QIDQ2010917
Jochen Könemann, Stephan Held, Jens Vygen
Publication date: 28 November 2019
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.04991
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Uses Software
Cites Work
- New inapproximability bounds for TSP
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max tree covers of graphs.
- The Steiner tree problem on graphs: inapproximability results
- Approximation hardness of min-max tree covers
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Balancing minimum spanning trees and shortest-path trees
- Approximating the \(k\)-traveling repairman problem with repair times
- Capacitated Vehicle Routing with Nonuniform Speeds
- Approximation algorithms for distance constrained vehicle routing problems
- Vehicle Routing
- Approximation results for min-max path cover problems in vehicle routing
- To fill or not to fill
- Minimum Makespan Multi-vehicle Dial-a-Ride
- The Traveling Salesman Problem with Distances One and Two
- Shallow-Light Steiner Arborescences with Vertex Delays
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximations for minimum and min-max vehicle routing problems
This page was built for publication: Vehicle routing with subtours
