The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The traveling salesman problem on a graph and some related integer polyhedra
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
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
Ratliff, H. D., & Rosenthal, A. S. (1983) · Operations Research · doi:10.1287/opre.31.3.507 · Cited by 628
Facets of I-matching polyhedra
Pulleyblank, W. R., & Edmonds, J. (1974) · Lecture notes in mathematics · doi:10.1007/bfb0066196 · Cited by 136
On the relationship between the biconnectivity augmentation and travelling salesman problems
Frederickson, G. N., & JáJá, J. F. (1982) · Theoretical Computer Science · doi:10.1016/0304-3975(82)90059-7 · Cited by 91
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Matai, R., Singh, S., & Lal, M. (2010) · Traveling Salesman Problem, Theory and Applications · doi:10.5772/12909 · Cited by 299
Design and control of warehouse order picking: A literature review
de Koster, R., Le-Duc, T., & Roodbergen, K. J. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.07.009 · Cited by 114
Vehicle routing problems with road‐network information: State of the art
Ben Ticha, H., Absi, N., Feillet, D., & Quilliot, A. (2018) · Networks · doi:10.1002/net.21808 · Cited by 51
Metadata
- Authors
- Cornuéjols, G., Fonlupt, J., & Naddef, D.
- Venue
- Mathematical Programming
- Published
- 1985-09
- Volume
- 33
- Issue
- 1
- Pages
- 1-27
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2083210138
- Cited by
- 280
- References
- 5
- FWCI
- 2.22
- 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.