Keywords
Travelling salesman problemMathematical optimizationBottleneck traveling salesman problem2-optMathematicsCombinatorial optimizationComputer scienceSoftwareLin–Kernighan heuristicCombinatorics
Affiliated Institutions
Related Publications
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is base...
Local Search for the Asymmetric Traveling Salesman Problem
We present an extension of the Lin-Kernighan local search algorithm for the solution of the asymmetric traveling salesman problem. Computational results suggest that our heurist...
APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS
Natural evolution provides a paradigm for the design of stochastic-search optimization algorithms. Various forms of simulated evolution, such as genetic algorithms and evolution...
Solving symmetric and asymmetric TSPs by ant colonies
We present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to b...
Computer Solutions of the Traveling Salesman Problem
Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer. The first produces guaranteed optimal solu...
Publication Info
- Year
- 1987
- Type
- article
- Volume
- 6
- Issue
- 1
- Pages
- 1-7
- Citations
- 390
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
390
OpenAlex
Cite This
Manfred Padberg,
Giovanni Rinaldi
(1987).
Optimization of a 532-city symmetric traveling salesman problem by branch and cut.
Operations Research Letters
, 6
(1)
, 1-7.
https://doi.org/10.1016/0167-6377(87)90002-2
Identifiers
- DOI
- 10.1016/0167-6377(87)90002-2