Online Black-Box Algorithm Portfolios for Continuous Optimization-Reference-Cited by-同舟云学术

Online Black-Box Algorithm Portfolios for Continuous Optimization

Published:2014 Issue: Volume: Page:40-49
ISSN:0302-9743
Container-title:Parallel Problem Solving from Nature – PPSN XIII
language:
Short-container-title:

Author:

Baudiš Petr,Pošík Petr

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-10762-2_4

Reference23 articles.

1. Nelder, J.A., Mead, R.: A simplex method for function minimization. The Computer Journal 7(4), 308–313 (1965)

2. Hansen, N., et al.: Comparing continuous optimisers: Coco, http://coco.gforge.inria.fr/

3. Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking 2012: Experimental setup. Technical report, INRIA (2012)

4. Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65–118 (1976)

5. Kotthoff, L.: Algorithm selection for combinatorial search problems: A survey. AI Magazine (2014)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Benchmarking Feature-Based Algorithm Selection Systems for Black-Box Numerical Optimization;IEEE Transactions on Evolutionary Computation;2022-12

2. Algorithm portfolio for individual-based surrogate-assisted evolutionary algorithms;Proceedings of the Genetic and Evolutionary Computation Conference;2019-07-13

3. On the Design of a Master-Worker Adaptive Algorithm Selection Framework;Lecture Notes in Computer Science;2018

4. A Fitness Cloud Model for Adaptive Metaheuristic Selection Methods;Parallel Problem Solving from Nature – PPSN XIV;2016

5. Distributed Adaptive Metaheuristic Selection: Comparisons of Selection Strategies;Lecture Notes in Computer Science;2016