{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T17:06:12Z","timestamp":1748883972057,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cec.2004.1330860","type":"proceedings-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T09:50:22Z","timestamp":1096365022000},"page":"220-226","source":"Crossref","is-referenced-by-count":5,"title":["NFL theorem is unusable on structured classes of problems"],"prefix":"10.1109","author":[{"given":"B.","family":"Weinberg","sequence":"first","affiliation":[]},{"given":"E.-G.","family":"Talbi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5775-3_18"},{"journal-title":"E?tude des Me?taheuristique Pour la Re?solution du Proble?me de Statisfaction de Contraintes et de la Coloration de Graphes","year":"1999","author":"galignier","key":"15"},{"key":"16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"taillard","year":"1991","journal-title":"Parallel Computing"},{"year":"0","author":"robinson","key":"13"},{"journal-title":"Computational Complexity","year":"1994","author":"papadimitriou","key":"14"},{"key":"11","first-page":"833","article-title":"Perhaps not a free lunch but at least a free appetizer","author":"droste","year":"1999","journal-title":"Proceedings of the First Genetic and Evolutionary Computation Conference(GECCO '99)"},{"key":"12","article-title":"From 3-sat to {2+p},{3}-sat","author":"giritli","year":"2001","journal-title":"Technical Report"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1007\/b101931","author":"voss","year":"2002","journal-title":"Optimization Software Class Libraries"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213274"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"10","first-page":"565","article-title":"The no free lunch and problem description length","author":"schumacher","year":"2001","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050684-5.50017-3"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00094-4"},{"key":"5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/3-540-36599-0_45","article-title":"No free lunch, program induction and combinatorial problems","author":"woodward","year":"2003","journal-title":"Genetic Programming"},{"key":"4","article-title":"On the futility of blind search","volume":"96","author":"culberson","year":"1996","journal-title":"Technical Report"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00222-9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-094832-4.50011-8"}],"event":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation","acronym":"CEC-04","location":"Portland, OR, USA"},"container-title":["Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9256\/29383\/01330860.pdf?arnumber=1330860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T07:30:56Z","timestamp":1533713456000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1330860\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/cec.2004.1330860","relation":{},"subject":[]}}