Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP)
- 1 May 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 24 (5), 728-735
- https://doi.org/10.1109/21.293486
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Local search for satisfiability (SAT) problemIEEE Transactions on Systems, Man, and Cybernetics, 1993
- Efficient local search for very large-scale satisfiability problemsACM SIGART Bulletin, 1992
- 3,000,000 Queens in less than one minuteACM SIGART Bulletin, 1991
- Fast search algorithms for the n-queens problemIEEE Transactions on Systems, Man, and Cybernetics, 1991
- A polynomial time algorithm for the N-Queens problemACM SIGART Bulletin, 1990
- More approaches to the travelling salesman guideNature, 1987
- An analogue approach to the travelling salesman problem using an elastic net methodNature, 1987
- Optimization by Simulated AnnealingScience, 1983
- Heuristic for the Hamiltonian Path Problem in Euclidian Two SpaceJournal of the Operational Research Society, 1979
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977