Constructing efficient simulated annealing algorithms

DOI10.1016/S0166-218X(96)00132-1zbMath0881.90104MaRDI QIDQ1364480

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

Markov chainssimulated annealingtabu searchchannel assignmentejection chainscombinatorial leverage phenomenondesign of cellular radio systemsMetropolis criterion

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (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

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Tabu search for the multilevel generalized assignment problem
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence of an annealing algorithm
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Fast Clustering Algorithms

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