On the complexity of restarting

DOI10.1007/978-3-030-19955-5_22MaRDI QIDQ2330563zbMATH OpenOpenAlexFDO

Authors Jan-Hendrik Lorenz

Publication date 22 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-19955-5_22

zbMATH Keywords

\(\#\)Pcomputational complexityfixed-cutoff strategyinapproximabilityNPprobability distributionrestarts

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Runtime distributions and criteria for restarts
• Restart strategies in a continuous setting
• Restart strategies in optimization: parallel and serial cases
• Restarting search algorithms with applications to simulated annealing
• Random restarting versus simulated annealing

Cited in

(2)

• Promise problems on probability distributions
• Restart strategies in a continuous setting

This page was built for publication: On the complexity of restarting

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