Optimization, block designs and No Free Lunch theorems

Information Processing Letters

Volumn 94, Issue 2, 2005, Pages 55-61

  Griffiths, Evan J ^a   Orponen, Pekka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Combinatorial designs; Combinatorial problems; No Free Lunch theorems; Optimization; Theory of computation

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

COMBINATORIAL DESIGNS; COMBINATORIAL PROBLEMS; NO FREE LUNCH THEOREM; THEORY OF COMPUTATION;

COMPUTATION THEORY;

EID: 14644430892     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.12.015     Document Type: Article

References (21)

1. E. Aarts, and J.K. Lenstra Local Search in Combinatorial Optimization 1997 John Wiley and Sons Chichester
2. T. Beth, D. Jungnickel, and H. Lenz Design Theory second ed. 1999 Cambridge University Press Cambridge, MA
3. S. Christensen, and F. Oppacher What can we learn from No Free Lunch? A first attempt to characterize the concept of a searchable function Proc. Genetic and Evolutionary Computation Conference GECCO-2001 2001 Morgan Kaufmann San Francisco, CA 1219 1226
4. C. Colbourn J. Dinitz The CRC Handbook of Combinatorial Designs 1996 CRC Press Boca Raton, FL
5. D. Corne, and J. Knowles Some multiobjective optimizers are better than others Proc. 2003 Congress on Evolutionary Computation (CEC-2003) 2003 IEEE New York, NY 2506 2512
6. S. Droste, T. Jansen, and I. Wegener Perhaps not a free lunch but at least a free appetizer Proc. Genetic and Evolutionary Computation Conference GECCO-1999 1999 Morgan Kaufmann San Francisco, CA 833 839
7. S. Droste, T. Jansen, and I. Wegener Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions Theoret. Comput. Sci. 287 2002 131 144
8. T. English No more lunch: Analysis of sequential search Proc. 2004 Congress on Evolutionary Computation (CEC-2004) 2004 IEEE New York, NY 227 234
9. C. Igel, and M. Toussaint On classes of functions for which No Free Lunch results hold Inform. Process. Lett. 86 2003 317 321
10. C. Igel, and M. Toussaint A No-Free-Lunch theorem for non-uniform distributions of target functions J. Math. Model. Algorithms 3 2004 313 322
11. S. Kageyama A property of t-wise balanced designs Ars Comb. 31 1991 237 238
12. M. Köppen No-Free-Lunch theorems and the diversity of algorithms Proc. 2004 Congress on Evolutionary Computation (CEC-2004) 2004 IEEE New York, NY 235 241
13. E.S. Kramer Some results on t-wise balanced designs Ars Comb. 15 1983 179 192
14. J.H. van Lint, and R.M. Wilson A Course in Combinatorics second ed. 2001 Cambridge University Press Cambridge, MA
15. R.C. Mullin A note on self-complementary designs Congr. Numer. 10 1974 591 598
16. N.J. Radcliffe, and P.D. Surry Fundamental limitations on search algorithms: evolutionary computing in perspective J. van Leeuwen Computer Science Today: Recent Trends and Developments Lecture Notes in Comput. Sci. vol. 1000 1995 Springer-Verlag Berlin 275 291
17. C. Schumacher, M.D. Vose, and L.D. Whitley The No Free Lunch and problem description length Proc. Genetic and Evolutionary Computation Conference GECCO-2001 2001 Morgan Kaufmann San Francisco, CA 565 570
18. M.J. Streeter Two broad classes of functions for which a No Free Lunch result does not hold Proc. Genetic and Evolutionary Computation Conference GECCO-2003 2003 Morgan Kaufmann San Francisco, CA 1418 1430
19. L. Teirlinck Non-trivial t-designs without repeated blocks exist for all t Discrete Math. 65 1987 301 311
20. L. Teirlinck Locally trivial t-designs and t-designs without repeated blocks Discrete Math. 77 1989 345 356
21. D.H. Wolpert, and W.G. Macready No Free Lunch theorems for optimization IEEE Trans. Evolut. Comput. 1 1997 67 82