Searching for backbones — an efficient parallel algorithm for the traveling salesman problem
- 1 August 1996
- journal article
- Published by Elsevier in Computer Physics Communications
- Vol. 96 (2-3) , 173-188
- https://doi.org/10.1016/0010-4655(96)00062-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Determination of candidate structures for simple ionic compounds through cell optimisationComputational Materials Science, 1995
- Scaling features in complex optimization problemsComputer Physics Communications, 1995
- New Optimization HeuristicsJournal of Computational Physics, 1993
- Solution of large-scale symmetric travelling salesman problemsMathematical Programming, 1991
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealingJournal of Computational Physics, 1990
- Evolution algorithms in combinatorial optimizationParallel Computing, 1988
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Optimization by Simulated AnnealingScience, 1983
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953