The demon algorithm

DOI10.1080/00207169208804047MaRDI QIDQ3989748zbMATH OpenOpenAlexFDO

Authors Theo Zimmermann, Peter Salamon

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

simulated annealingglobal optimizationgraph bipartitioningDemon algorithminformation- theoretic analysis of simulated annealing

Mathematics Subject Classification ID

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

Recommendations

• Optimization by simulated annealing
• Simulated annealing: A tool for operational research
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• scientific article; zbMATH DE number 906529
• scientific article; zbMATH DE number 1372529

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3390587 (Why is no real title available?)
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Cooling Schedules for Optimal Annealing
• Optimization by simulated annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(1)

• Latest News about Demonic Algebra with Domain

This page was built for publication: The demon algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989748)