Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems

DOI10.1007/978-3-319-21398-9_12zbMath1465.68311OpenAlexW1137738072MaRDI QIDQ3196380

Wei Yu, Zhaohui Liu

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_12

zbMATH Keywords

vehicle routingapproximation algorithmtraveling salesman problemcycle cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Cites Work

• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Capacitated dynamic lot-sizing problem with delivery/production time windows
• Min-max tree covers of graphs.
• Approximation results for a min-max location-routing problem
• Approximating the minmax rooted-tree cover in a tree
• Approximation algorithms for distance constrained vehicle routing problems
• Approximation Algorithms for the Multi-Vehicle Scheduling Problem
• Approximation results for min-max path cover problems in vehicle routing
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Algorithms and Computation
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
• Approximations for minimum and min-max vehicle routing problems
• Minmax Tree Cover in the Euclidean Space

This page was built for publication: Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems