The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Complexity of vehicle routing and scheduling problems
Open accessAbstract
The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP‐hardness results and compile the results on the worst‐case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park, June 4–6, 1979.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
Matching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 980
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II (1977) · SIAM Journal on Computing · doi:10.1137/0206041 · Cited by 837
The Euclidean travelling salesman problem is NP-complete
Papadimitriou, C. H. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90012-3 · Cited by 776
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
On the Computational Complexity of Combinatorial Problems
Karp, R. M. (1975) · Networks · doi:10.1002/net.1975.5.1.45 · Cited by 711
The Planar Hamiltonian Circuit Problem is NP-Complete
Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205049 · Cited by 539
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Karp, R. M. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.209 · Cited by 439
Approximation Algorithms for Some Routing Problems
Frederickson, G. N., Hecht, M. S., & Kim, C. E. (1978) · SIAM Journal on Computing · doi:10.1137/0207017 · Cited by 427
Some NP-complete geometric problems
Garey, M. R., Graham, R. L., & Johnson, D. S. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803626 · Cited by 400
Computational Complexity of Discrete Optimization Problems
Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70821-5 · Cited by 292
Self-citationA fundamental problem in vehicle routing
Orloff, C. S. (1974) · Networks · doi:10.1002/net.3230040105 · Cited by 266
Approximation Algorithms for Some Postman Problems
Frederickson, G. N. (1979) · Journal of the ACM · doi:10.1145/322139.322150 · Cited by 182
On the complexity of edge traversing
Papadimitriou, C. H. (1976) · Journal of the ACM · doi:10.1145/321958.321974 · Cited by 163
Some Examples of Difficult Traveling Salesman Problems
Papadimitriou, C. H., & Steiglitz, K. (1978) · Operations Research · doi:10.1287/opre.26.3.434 · Cited by 82
On the structure of combinatorial problems and structure preserving reductions
Ausiello, G., D’Atri, A., & Protasi, M. (1977) · Lecture notes in computer science · doi:10.1007/3-540-08342-1_4 · Cited by 30
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601163 · Cited by 897
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
The electric vehicle routing problem with nonlinear charging function
Montoya, A., Guéret, C., Mendoza, J. E., & Villegas, J. G. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2017.02.004 · Cited by 627
Metadata
- Authors
- Lenstra, J. K., & Kan, A. H. G. R.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1981-06
- Volume
- 11
- Issue
- 2
- Pages
- 221-227
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2146870367
- Cited by
- 1,325
- References
- 20
- FWCI
- 20.77
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.