Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- 1 March 1987
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 6 (1) , 1-7
- https://doi.org/10.1016/0167-6377(87)90002-2
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman ProblemOperations Research, 1959
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954