IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1986 · 149 citations · 10 references
Natural SciencesComputer ScienceAlgorithmsOptimizationCombinatorial OptimizationMetaheuristic OptimizationPopulation-based SearchAnnealingCost Function ModelingEvolutionary AlgorithmsPartitioningSimulated AnnealingSimulated Annealing Optimization
The customary need for rejection of candidate moves in simulated annealing is eliminated by biasing the selection of moves according to their effect on the cost function. An efficient implementation can offer a significant speed-up, though with increased memory. The logic partitioning problem is used as an illustration; both simple moves and pairwise interchanges are considered.
10
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
Equation of State Calculations by Fast Computing Machines
N. Metropolis, Arianna W. Rosenbluth, M. N. Rosenbluth et al. · The Journal of Chemical Physics · 1953 · 37.1K citations
Information Theory and Reliable Communication
David A. Bell · Electronics and Power · 1969 · 4K citations