Downhill simplex methods for optimizing simulated annealing are effective

MaRDI QIDQ3646696zbMATH OpenFDO

Authors Patrick D. Bangert

Publication date 27 November 2009

zbMATH Keywords

algorithmbraid groupbraid groupscooling scheduledownhill simplexdownhill simplex methodheuristicknown NP-complete problemminimum length wordnumerical examplessimulated annealing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Recommendations

• Optimization by simulated annealing
• Simulated annealing for single minimum optimization problems
• scientific article; zbMATH DE number 26827
• A systematic procedure for setting parameters in simulated annealing algorithms
• Simulated Annealing: Searching for an Optimal Temperature Schedule

This page was built for publication: Downhill simplex methods for optimizing simulated annealing are effective

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