Bounding the probability of success of stochastic methods for global optimization

DOI10.1016/0898-1221(93)90275-ZMaRDI QIDQ1802488zbMATH OpenOpenAlexFDO

Authors Afonso G. Ferreira, Janez Žerovnik

Publication date 21 July 1993

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

Full work available at URL https://doi.org/10.1016/0898-1221(93)90275-z

zbMATH Keywords

near-optimal solutionsparallel implementations of simulated annealingsimulated annealing

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial optimization (90C27)

Recommendations

• Simulated annealing methods with general acceptance probabilities
• scientific article; zbMATH DE number 203097
• scientific article; zbMATH DE number 1183278
• scientific article; zbMATH DE number 6019551
• Computational Science and Its Applications – ICCSA 2004

Cites work

• Convergence and finite-time behavior of simulated annealing
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• Optimization by simulated annealing
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm

Cited in

(11)

• Random restarting versus simulated annealing
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Improved lower bound on the Shannon capacity of C₇
• Local search with memory: Benchmarking RTS
• Parallel local search
• Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
• The method of global equilibrium search
• Problems of discrete optimization: challenges and main approaches to solve them
• scientific article; zbMATH DE number 1199856 (Why is no real title available?)
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• Performance analysis of cyclical simulated annealing algorithms

This page was built for publication: Bounding the probability of success of stochastic methods for global optimization

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