Simple Explanation of the No-Free-Lunch Theorem and Its Implications
Top Cited Papers
- 1 December 2002
- journal article
- Published by Springer Science and Business Media LLC in Journal of Optimization Theory and Applications
- Vol. 115 (3), 549-570
- https://doi.org/10.1023/a:1021251113462
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Remarks on a recent paper on the "no free lunch" theoremsIEEE Transactions on Evolutionary Computation, 2001
- Report on the fuzzy versus conventional control debateIEEE Control Systems, 1999
- An explanation of ordinal optimization: Soft computing for hard problemsInformation Sciences, 1999
- On the Futility of Blind Search: An Algorithmic View of “No Free Lunch”Evolutionary Computation, 1998
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systemsJournal of Optimization Theory and Applications, 1996
- Fundamental limitations on search algorithms: Evolutionary computing in perspectivePublished by Springer Science and Business Media LLC ,1995