Conditions that Obviate the No-Free-Lunch Theorems for Optimization

References

• Culberson J. C. On the futility of blind search: An algorithmic view of “no free lunch”. Evol. Comput. (1998) 6(2):109–127Crossref, Google Scholar
• Dantzig G., Fulkerson D., Johnson S. Solution of a large-scale traveling-salesman problem. Oper. Res. (1954) 2:393–410Link, Google Scholar
• Droste S., Jansen T., Wegener I. Perhaps not a free lunch but at least a free appetizer. Genetic and Evol. Comput. Conf. GECCO-99 (1999) (Morgan Kaufmann, San Francisco, CA) 833–839Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Geller D., Kra I., Popescu S., Simanca S. On circulant matrices. (2002) . State University of New York at Stony Brook, Stony Brook, NY, http://www.math.sunysb.edu/∼sorin/eprints/circulant.pdfGoogle Scholar
• Glover F. Tabu search—part i. ORSA J. Comput. (1989) 1:190–260Link, Google Scholar
• Glover F. Tabu search—part ii. ORSA J. Comput. (1990) 2:4–32Link, Google Scholar
• Goldberg D. E.Genetic Algorithms in Search, Optimization and Machine Learning (1989) (Addison-Wesley Longman Publishing Co., Inc., Boston, MA) Google Scholar
• Hooker J. N. Testing heuristics: We have it all wrong. J. Heuristics (1995) 1:33–42Crossref, Google Scholar
• Igel C., Toussaint M. On classes of functions for which no free lunch results hold. Inform. Processing Lett. (2003a) 86:317–321Crossref, Google Scholar
• Igel C., Toussaint M. Recent results on no-free-lunch theorems for optimization. (2003b) . Institut für Neuroinformatik and Ruhr-Universität Bochum, GermanyGoogle Scholar
• Kirkpatrick S., Gelatt D. C., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Langevin A., Soumis F., Desrosiers J. Classification of travelling salesman problem formulations. Oper. Res. Lett. (1990) 9:127–132Crossref, Google Scholar
• Maurras J. F., Roy B. Some results on the convex hull of Hamiltonian cycles of symmetric complete graphs. Combinatorial Programming: Methods and Applications (1975) (Reidel Publishing Company, Dordrecht, Holland) 179–190Crossref, Google Scholar
• Radcliffe N. J., Surry P. D., van Leeuwen J. Fundamental limitations on search algorithms: Evolutionary computing in perspective. Lecture Notes in Computer Science (1995) 1000(Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Schott J. R.Matrix Analysis for Statistics (1997) (John Wiley and Sons, New York) Google Scholar
• Schuhmacher C., Vose M. D., Whitley L. D., Spector L., Goodman E., Wu A., Langdon W., Voigt H.-M., Gen M., Sen S., Dorigo M., Pezeshk S., Garzon M., Burke E. The no free lunch and description length. Genetic and Evol. Comput. Conf. (GECCO 2001) (2001) (Morgan Kaufmann, San Francisco, CA) 565–570Google Scholar
• Wegener I. Tutorial: Computational complexity and EC. Genetic and Evol. Comput. Conf. (GECCO 2004) (2004) (Morgan Kaufmann, San Francisco, CA) Google Scholar
• Whitley D., Watson J. A “no free lunch” tutorial. (2004) (Department of Computer-Science, Colorado State University, Fort Collins, CO) Google Scholar
• Wolpert D. H., Macready W. G. No free lunch theorems for search. (1995) . Working Paper sfi-tr-95-02-010, Santa Fe Institute, Santa Fe, NMGoogle Scholar
• Wolpert D. H., Macready W. G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. (1997) 1:67–82Crossref, Google Scholar