Random restarting versus simulated annealing

DOI10.1016/0898-1221(94)90108-2zbMath0812.90127OpenAlexW2067551188MaRDI QIDQ1323618

V. Pereyra

Publication date: 1 June 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90108-2

zbMATH Keywords

simulated annealingdirect self-loopsrandom restarting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Bounding the probability of success of stochastic methods for global optimization
• Integrating and accelerating tabu search, simulated annealing, and genetic algorithms

This page was built for publication: Random restarting versus simulated annealing