Approximations for minimum and min-max vehicle routing problems
- 24 March 2005
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 59 (1), 1-18
- https://doi.org/10.1016/j.jalgor.2005.01.007
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Covering Graphs Using Trees and StarsLecture Notes in Computer Science, 2003
- Solution of a Min-Max Vehicle Routing ProblemINFORMS Journal on Computing, 2002
- Approximation Algorithms for Min–Max Tree PartitionJournal of Algorithms, 1997
(p − 1) (p + 1) -approximate algorithms for p-traveling salesmen problems on a tree with minmax objectiveDiscrete Applied Mathematics, 1997- On the Distance Constrained Vehicle Routing ProblemOperations Research, 1992
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- Approximation Algorithms for Some Postman ProblemsJournal of the ACM, 1979
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978
- On general routing problemsNetworks, 1976
- Transformation of Multisalesman Problem to the Standard Traveling Salesman ProblemJournal of the ACM, 1974