The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Integer Programming Formulation of Traveling Salesman Problems
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960) · Journal of the ACM · doi:10.1145/321043.321046 · Cited by 2,020
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Gillett, B. E., & Miller, L. R. (1974) · Operations Research · doi:10.1287/opre.22.2.340 · Cited by 1,179
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
Graph Theory: An Algorithmic Approach
Kay, E. (1976) · Journal of the Operational Research Society · doi:10.1057/jors.1976.202 · Cited by 902
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
Shekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
On an Integer Program for a Delivery Problem
Balinski, M., & Quandt, R. E. (1964) · Operations Research · doi:10.1287/opre.12.2.300 · Cited by 373
Cited by
The vehicle routing problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90192-c · Cited by 1,749
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
The multiple traveling salesman problem: an overview of formulations and solution procedures
Bektas, T. (2006) · Omega · doi:10.1016/j.omega.2004.10.004 · Cited by 1,153
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
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Metadata
- Authors
- Christofides, N., Mingozzi, A., & Toth, P.
- Venue
- Mathematical Programming
- Published
- 1981-12
- Volume
- 20
- Issue
- 1
- Pages
- 255-282
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2035231387
- Cited by
- 535
- References
- 11
- FWCI
- 34.62
- Type
- journal article
- Language
- en
- Open access
- closed
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.