{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:27Z","timestamp":1740122427807,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T00:00:00Z","timestamp":1340409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10878-012-9514-7","type":"journal-article","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T17:10:16Z","timestamp":1340385016000},"page":"256-270","source":"Crossref","is-referenced-by-count":2,"title":["A study of search algorithms\u2019 optimization speed"],"prefix":"10.1007","volume":"27","author":[{"given":"Andrea","family":"Valsecchi","sequence":"first","affiliation":[]},{"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,23]]},"reference":[{"key":"9514_CR1","volume-title":"Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing","author":"E Aarts","year":"1989","unstructured":"Aarts E, Korst J (1989) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. Wiley, New York"},{"key":"9514_CR2","first-page":"B2.7:5","volume-title":"Handbook of evolutionary computation","author":"L Altenberg","year":"1997","unstructured":"Altenberg L (1997) Nk fitness landscapes. In: Back T, et al. (eds) Handbook of evolutionary computation. IOP Publishing Ltd and Oxford University Press, Bristol, pp B2.7:5\u2013B2.7:10"},{"key":"9514_CR3","first-page":"93","volume-title":"Foundations of genetic algorithms","author":"K Deb","year":"1993","unstructured":"Deb K, Goldberg DE (1993) Analyzing deception in trap functions. In: Whitley D (ed) Foundations of genetic algorithms, vol 2. Morgan Kaufmann, San Mateo, pp 93\u2013108"},{"key":"9514_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-540-24652-7_10","volume-title":"EvoCOP","author":"TM English","year":"2004","unstructured":"English TM (2004) On the structure of sequential search: beyond \u201cno free lunch\u201d. In: Gottlieb J, Raidl GR (eds) EvoCOP. Lecture notes in computer science, vol 3004. Springer, Berlin, pp 95\u2013103"},{"key":"9514_CR5","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"issue":"2","key":"9514_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10539-006-9040-z","volume":"22","author":"O H\u00e4ggstr\u00f6m","year":"2006","unstructured":"H\u00e4ggstr\u00f6m O (2006) Intelligent design and the nfl theorems. Biol Philos 22(2):217\u2013230","journal-title":"Biol Philos"},{"key":"9514_CR7","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"1","key":"9514_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1976","unstructured":"Hyafil L, Rivest RL (1976) Constructing optimal binary decision trees is NP-complete. Inf Process Lett 5(1):15\u201317","journal-title":"Inf Process Lett"},{"issue":"4","key":"9514_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:JMMA.0000049381.24625.f7","volume":"3","author":"C Igel","year":"2004","unstructured":"Igel C, Toussaint M (2004) A no-free-lunch theorem for non-uniform distributions of target functions. J Math Model Algorithms 3(4):313\u2013322","journal-title":"J Math Model Algorithms"},{"issue":"23","key":"9514_CR10","doi-asserted-by":"crossref","first-page":"2422","DOI":"10.1016\/j.spl.2009.08.016","volume":"79","author":"K Jackson","year":"2009","unstructured":"Jackson K, Kreinin A, Zhang W (2009) Randomization in the first hitting time problem. Stat Probab Lett 79(23):2422\u20132428. doi: 10.1016\/j.spl.2009.08.016","journal-title":"Stat Probab Lett"},{"key":"9514_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BFb0015249","volume-title":"Fundamental limitations on search algorithms: evolutionary computing in perspective","author":"N Radcliffe","year":"1995","unstructured":"Radcliffe N, Surry PD (1995) Fundamental limitations on search algorithms: evolutionary computing in perspective. Lecture notes in computer science, vol 1000. Springer, Berlin, pp 275\u2013291"},{"key":"9514_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1162\/evco.2009.17.1.117","volume":"17","author":"JE Rowe","year":"2009","unstructured":"Rowe JE, Vose MD, Wright AH (2009) Reinterpreting no free lunch. Evol Comput 17:117\u2013129. DOI http:\/\/dx.doi.org\/10.1162\/evco.2009.17.1.117 . URL http:\/\/dx.doi.org\/10.1162\/evco.2009.17.1.117","journal-title":"Evol Comput"},{"key":"9514_CR13","first-page":"565","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO-2001)","author":"C Schumacher","year":"2001","unstructured":"Schumacher C, Vose MD, Whitley LD (2001) The no free lunch and problem description length. In: Spector L, Goodman ED, Wu A, Langdon WB, Voigt HM, Gen M, Sen S, Dorigo M, Pezeshk S, Garzon MH, Burke E (eds) Proceedings of the genetic and evolutionary computation conference (GECCO-2001). Morgan Kaufmann, San Francisco, pp 565\u2013570. URL cite-seer.ist.psu.edu\/schumacher01no.html"},{"key":"9514_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/978-3-540-78761-7_69","volume-title":"International workshop on theoretical aspects in artificial evolution, EvoTheory 2008. Proceedings of applications of evolutionary computing, EvoWorkshops 2008","author":"A Valsecchi","year":"2008","unstructured":"Valsecchi A, Vanneschi L (2008) A study of some implications of the no free lunch theorem. In: Gi- acobini M, et al. (eds) International workshop on theoretical aspects in artificial evolution, EvoTheory 2008. Proceedings of applications of evolutionary computing, EvoWorkshops 2008. Lecture notes in computer science, vol 4974. Springer, Berlin, pp 633\u2013642"},{"issue":"1","key":"9514_CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. URL citeseer.ist.psu.edu\/wolpert96no.html","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9514-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9514-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9514-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:18Z","timestamp":1559262198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9514-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,23]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9514"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9514-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2012,6,23]]}}}