Complexity of vehicle routing and scheduling problems
- 1 June 1981
- Vol. 11 (2), 221-227
- https://doi.org/10.1002/net.3230110211
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Approximation Algorithms for Some Postman ProblemsJournal of the ACM, 1979
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Evaluating a Sequential Vehicle Routing AlgorithmA I I E Transactions, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- On the complexity of edge traversingJournal of the ACM, 1976
- On general routing problemsNetworks, 1976
- A fundamental problem in vehicle routingNetworks, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Minimizing the number of tankers to meet a fixed scheduleNaval Research Logistics Quarterly, 1954