On the Structure of Sequential Search: Beyond “No Free Lunch”-Reference-Cited by-同舟云学术

On the Structure of Sequential Search: Beyond “No Free Lunch”

Published:2004 Issue: Volume: Page:95-103
ISSN:0302-9743
Container-title:Evolutionary Computation in Combinatorial Optimization
language:
Short-container-title:

Author:

English Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24652-7_10.pdf

Reference10 articles.

1. Wolpert, D., Macready, W.: No Free Lunch Theorems for Search. Santa Fe Institute, SFITR- 02-010 (1995)

2. Wolpert, D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Trans. Evolutionary Computation 1, 67–82 (1997)

3. Schumacher, C., Vose, M.D., Whitley, L.D.: The No Free Lunch and Problem Description Length. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W., Voight, H.M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 565–570. Morgan Kaufmann, San Francisco (2001)

4. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley & Sons, New York (1991)

5. Park, K.: Genetic Algorithms Digest 9 (1995), http://www.aic.nrl.navy.mil/galist/digests/v9n10

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

1. When and Why Metaheuristics Researchers can Ignore “No Free Lunch” Theorems;SN Computer Science;2020-01

2. A Review of No Free Lunch Theorems, and Their Implications for Metaheuristic Optimisation;Nature-Inspired Algorithms and Applied Optimization;2017-10-10

3. No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics;Theory and Principled Methods for the Design of Metaheuristics;2013-11-12

4. A study of search algorithms’ optimization speed;Journal of Combinatorial Optimization;2012-06-23

5. Stochastic Search in Metaheuristics;Handbook of Metaheuristics;2010