Greedy Restart Schedules: A Baseline for Dynamic Algorithm Selection on Numerical Black-box Optimization Problems

Schäpermeier, Lennart

Research article in edited proceedings (conference) | Peer reviewed

Abstract

Details about the publication

PublisherFilipic, Bogdan
Book titleProceedings of the Genetic and Evolutionary Computation Conference, GECCO 2025
Page range1199-1207
Publishing companyACM Press
Place of publication online
StatusPublished
Release year2025
ConferenceProceedings of the Genetic and Evolutionary Computation Conference, Malaga, Spain
DOI10.1145/3712256.3726408
Link to the full texthttps://doi.org/10.1145/3712256.3726408
KeywordsHeuristic optimization; Continuous optimization; Algorithm scheduling; Dynamic algorithm selection; Benchmarking; Performance analysis

Authors from the University of Münster

Schäpermeier, Lennart Merlin
Research Group Computational Social Science and Systems Analysis (CSSSA)