Bounding the probability of success of stochastic methods for global optimization

DOI10.1016/0898-1221(93)90275-ZzbMath0806.90103MaRDI QIDQ1802488

Janez Žerovnik, Afonso G. Ferreira

Publication date: 21 July 1993

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

zbMATH Keywords

simulated annealing; near-optimal solutions; parallel implementations of simulated annealing

Mathematics Subject Classification ID

90C27: Combinatorial optimization

65Y05: Parallel numerical computation

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Performance analysis of cyclical simulated annealing algorithms, 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_7\), 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

Cites Work

• Optimization by Simulated Annealing
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Convergence and finite-time behavior of simulated annealing
• Unnamed Item