Metropolis versus simulated annealing and the black-box-complexity of optimization problems

zbMATH Open1214.90126MaRDI QIDQ3535299FDOQ3535299

Authors: Ingo Wegener 

Publication date: 10 November 2008

Recommendations

• Upper and lower bounds for randomized search heuristics in black-box optimization
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 6019551
• Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
• Black-box complexity for bounding the performance of randomized search heuristics

zbMATH Keywords

minimum spanning treerandomized search heuristicsblack-box-complexity

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (2)

• On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
• Title not available (Why is that?)

This page was built for publication: Metropolis versus simulated annealing and the black-box-complexity of optimization problems

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