Thomas Jansen. Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics. In Yossi Borenstein, Alberto Moraglio, editors, Theory and Principled Methods for the Design of Metaheuristics. Natural Computing Series, pages 85-110, Springer, 2014. [doi]
@incollection{Jansen14-3,
title = {Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics},
author = {Thomas Jansen},
year = {2014},
doi = {10.1007/978-3-642-33206-7_5},
url = {http://dx.doi.org/10.1007/978-3-642-33206-7_5},
researchr = {https://researchr.org/publication/Jansen14-3},
cites = {0},
citedby = {0},
pages = {85-110},
booktitle = {Theory and Principled Methods for the Design of Metaheuristics},
editor = {Yossi Borenstein and Alberto Moraglio},
series = {Natural Computing Series},
publisher = {Springer},
isbn = {978-3-642-33205-0},
}