A concise guide to the Traveling Salesman Problem
Author:
- 1 January 2010
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 61 (1) , 35-40
Abstract
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.Keywords
This publication has 33 references indexed in Scilit:
- Certification of an optimal TSP tour through 85,900 citiesOperations Research Letters, 2009
- Assignment Problems2009
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problemJournal of the Operational Research Society, 2007
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problemsMathematical Programming, 2003
- Exact solution of large-scale, asymmetric traveling salesman problemsACM Transactions on Mathematical Software, 1995
- Primal-dual algrorithms for the assignment problemDiscrete Applied Mathematics, 1987
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- A Method for Solving Traveling-Salesman ProblemsOperations Research, 1958