Combining simulated annealing with local search heuristics
- 1 February 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 63 (1) , 57-75
- https://doi.org/10.1007/bf02601639
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Local optimization and the Traveling Salesman ProblemPublished by Springer Nature ,2005
- Partitioning of unstructured meshes for load balancingConcurrency: Practice and Experience, 1995
- Large-step markov chains for the TSP incorporating local search heuristicsOperations Research Letters, 1992
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- On the magnetisation of the ground states in two dimensional Ising spin glassesComputer Physics Communications, 1988
- Evolution algorithms in combinatorial optimizationParallel Computing, 1988
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Application of statistical mechanics to NP-complete problems in combinatorial optimisationJournal of Physics A: General Physics, 1986
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Optimization by Simulated AnnealingScience, 1983