The demon algorithm

DOI10.1080/00207169208804047zbMath0745.90063OpenAlexW2153124834MaRDI QIDQ3989748

Peter Salamon, Theo Zimmermann

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804047

zbMATH Keywords

global optimizationsimulated annealinggraph bipartitioningDemon algorithminformation- theoretic analysis of simulated annealing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Cooling Schedules for Optimal Annealing

This page was built for publication: The demon algorithm