The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Abstract
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting-plane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the incidence vectors of the hamiltonian cycles of a complete graph. The cuts are generated by several identification procedures that have been described in a companion paper. Whenever the cutting-plane procedure does not terminate with an optimal solution the algorithm uses a tree-search strategy that, as opposed to branch-and-bound, keeps on producing cuts after branching. The algorithm has been implemented in FORTRAN. Two different linear programming (LP) packages have been used as the LP solver. The implementation of the algorithm and the interface with one of the LP solvers is described in sufficient detail to permit the replication of our experiments. Computational results are reported with up to 42 STSPs with sizes ranging from 48 to 2,392 nodes. Most of the medium-sized test problems are taken from the literature; all others are large-scale real-world problems. All of the instances considered in this study were solved to optimality by the algorithm in “reasonable” computation times.
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
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
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
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Solution of a Large-Scale Traveling-Salesman Problem
Dantzig, G. B., Fulkerson, R., & Johnson, S. M. (1954) · Journal of the Operations Research Society of America · doi:10.1287/opre.2.4.393 · Cited by 1,483
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
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
Lau, H. T. (1986) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-61649-5_4 · Cited by 796
On the facial structure of set packing polyhedra
Padberg, M. W. (1973) · Mathematical Programming · doi:10.1007/bf01580121 · Cited by 596
Self-citationGeneralized Feedback Shift Register Pseudorandom Number Algorithm
Lewis, T. G., & Payne, W. H. (1973) · Journal of the ACM · doi:10.1145/321765.321777 · Cited by 312
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Crowder, H., & Padberg, M. W. (1980) · Management Science · doi:10.1287/mnsc.26.5.495 · Cited by 294
Self-citationThe Design of the XMP Linear Programming Library
Marsten, R. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355972.355976 · Cited by 245
LP-Based Combinatorial Problem Solving
Hoffman, K., & Padberg, M. W. (1985) · Springer eBooks · doi:10.1007/978-3-642-82450-0_3 · Cited by 104
Self-citationLp-based combinatorial problem solving
Hoffman, K., & Padberg, M. W. (1985) · Annals of Operations Research · doi:10.1007/bf02022040 · Cited by 84
Self-citation
Cited by
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
Katz, G., Barrett, C., Dill, D. L., Julian, K., & Kochenderfer, M. J. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63387-9_5 · Cited by 1,706
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Helsgaun, K. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00284-2 · Cited by 1,630
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Wireless Charging Technologies: Fundamentals, Standards, and Network Applications
Lu, X., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2499783 · Cited by 968
An algorithmic framework for convex mixed integer nonlinear programs
Bonami, P., Biegler, L. T., Conn, A. R., Cornuéjols, G., Grossmann, I. E., Laird, C. D., Lee, J., Lodi, A., Margot, F., Sawaya, N., et al. (2008) · Discrete Optimization · doi:10.1016/j.disopt.2006.10.011 · Cited by 902
Metadata
- Authors
- Padberg, M., & Rinaldi, G.
- Venue
- SIAM Review
- Published
- 1991-03
- Volume
- 33
- Issue
- 1
- Pages
- 60-100
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2029242918
- Cited by
- 1,097
- References
- 16
- FWCI
- 58.28
- 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.