scientific article; zbMATH DE number 1183278

MaRDI QIDQ3838009zbMATH OpenFDO

Authors Andreas Nolte

Publication date 3 August 1998

zbMATH Keywords

algorithmapproximation algorithmsasymptotic convergencefinite time boundsheuristicslarge-scale combinatorial optimizationMarkov chainsperformance bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Recommendations

• A note on the finite time behavior of simulated annealing.
• scientific article; zbMATH DE number 1264422
• Convergence and finite-time behavior of simulated annealing
• On simulated annealing and nested annealing.
• scientific article; zbMATH DE number 1042737

Cited in

(6)

• Bounding the probability of success of stochastic methods for global optimization
• Mixing time and simulated annealing for the stochastic cellular automata
• A note on the finite time behavior of simulated annealing.
• A Band and Bound Technique for Simple Random Algorithms
• scientific article; zbMATH DE number 1264422 (Why is no real title available?)
• Finite-time performance analysis of static simulated annealing algorithms

This page was built for publication:

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