zbMATH — the first resource for mathematics

On classes of functions for which no free lunch results hold. (English) Zbl 1162.68816

68W20 Randomized algorithms
Full Text: DOI arXiv
[1] Droste, S.; Jansen, T.; Wegener, I., Perhaps not a free lunch but at least a free appetizer, (), 833-839
[2] Droste, S.; Jansen, T.; Wegener, I., Optimization with randomized search heuristics—the (A)NFL theorem, realistic scenarios, and difficult functions, Theoret. comput. sci., 287, 1, 131-144, (2002) · Zbl 1061.68145
[3] Feller, W., An introduction to probability theory and its applications, I, (1971), John Wiley & Sons New York · Zbl 0219.60003
[4] Schumacher, C.; Vose, M.D.; Whitley, L.D., The no free lunch and description length, (), 565-570
[5] Whitley, D., A free lunch proof for gray versus binary encodings, (), 726-733
[6] Wolpert, D.H.; Macready, W.G., No free lunch theorems for optimization, IEEE trans. evolutionary comput., 1, 1, 67-82, (1997)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.