Constructing efficient simulated annealing algorithms

DOI10.1016/S0166-218X(96)00132-1MaRDI QIDQ1364480zbMATH OpenFDO

Authors Manuel Duque-Antón

Publication date 29 January 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

channel assignmentcombinatorial leverage phenomenondesign of cellular radio systemsejection chainsMarkov chainsMetropolis criterionsimulated annealingtabu search

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4079162
• Simulated annealing with extended neighbourhood
• Optimization by simulated annealing
• Faster Simulated Annealing

Cites work

• Convergence of an annealing algorithm
• Fast Clustering Algorithms
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• scientific article; zbMATH DE number 1054962 (Why is no real title available?)
• Optimization by simulated annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Tabu search for the multilevel generalized assignment problem
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(2)

• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
• A survey of very large-scale neighborhood search techniques

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Constructing efficient simulated annealing algorithms

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