Nested annealing: A provable improvement to simulated annealing

DOI10.1016/0304-3975(92)90177-HzbMath0764.90089OpenAlexW2082432101WikidataQ126339130 ScholiaQ126339130MaRDI QIDQ1193895

Sanguthevar Rajasekaran, John H. Reif

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90177-h

zbMATH Keywords

simulated annealingnested annealing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)

Related Items (2)

Nested simulated annealing approach to periodic routing problem of a retail distribution system ⋮ Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A theory of the learnable
• Using simulated annealing to solve routing and location problems
• Convergence and finite-time behavior of simulated annealing
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• Planar Formulae and Their Uses
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast Monte-Carlo Test for Primality
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• New methods to color the vertices of a graph
• Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem

This page was built for publication: Nested annealing: A provable improvement to simulated annealing