{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:29Z","timestamp":1759847549273,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598275","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"453-460","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Data-driven local optima network characterization of QAPLIB instances"],"prefix":"10.1145","author":[{"given":"David","family":"Iclanzan","sequence":"first","affiliation":[{"name":"Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Daolio","sequence":"additional","affiliation":[{"name":"Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Tomassini","sequence":"additional","affiliation":[{"name":"Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554903"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.10.106"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_34"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2683591"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.01.005"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586481"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330217"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11925231_38"},{"key":"e_1_3_2_1_10_1","volume-title":"Relative distribution methods in the social sciences (statistics for social science and behavorial sciences)","author":"Handcock M. S.","year":"1999","unstructured":"M. S. Handcock and M. Morris . Relative distribution methods in the social sciences (statistics for social science and behavorial sciences) . 1999 . M. S. Handcock and M. Morris. Relative distribution methods in the social sciences (statistics for social science and behavorial sciences). 1999."},{"key":"e_1_3_2_1_11_1","series-title":"Series C (Applied Statistics), 28(1):100--108","volume-title":"Algorithm as 136: A k-means clustering algorithm. Journal of the Royal Statistical Society","author":"Hartigan J. A.","year":"1979","unstructured":"J. A. Hartigan and M. A. Wong . Algorithm as 136: A k-means clustering algorithm. Journal of the Royal Statistical Society . Series C (Applied Statistics), 28(1):100--108 , 1979 . J. A. Hartigan and M. A. Wong. Algorithm as 136: A k-means clustering algorithm. Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1):100--108, 1979."},{"key":"e_1_3_2_1_12_1","volume-title":"Morgan Kaufmann","author":"Hoos H. H.","year":"2005","unstructured":"H. H. Hoos and T. St\u00fctzle . Stochastic Local Search: Foundations and Applications . Morgan Kaufmann , San Francisco, CA , 2005 . H. H. Hoos and T. St\u00fctzle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco, CA, 2005."},{"key":"e_1_3_2_1_13_1","volume-title":"EvoStar 2014 (1), page (accepted)","author":"D.","year":"2014","unstructured":"D. Icl\\uanzan, F. Daolio , and M. Tomassini . Learning inherent networks from stochastic search methods . In EvoStar 2014 (1), page (accepted) , 2014 . D. Icl\\uanzan, F. Daolio, and M. Tomassini. Learning inherent networks from stochastic search methods. In EvoStar 2014 (1), page (accepted), 2014."},{"key":"e_1_3_2_1_14_1","volume-title":"cluster: Cluster Analysis Basics and Extensions","author":"Maechler M.","year":"2013","unstructured":"M. Maechler , P. Rousseeuw , A. Struyf , M. Hubert , and K. Hornik . cluster: Cluster Analysis Basics and Extensions , 2013 . R package version 1.14.4. M. Maechler, P. Rousseeuw, A. Struyf, M. Hubert, and K. Hornik. cluster: Cluster Analysis Basics and Extensions, 2013. R package version 1.14.4."},{"issue":"4","key":"e_1_3_2_1_15_1","first-page":"661","article-title":"Some comments on c p","volume":"15","author":"Mallows C. L.","year":"1973","unstructured":"C. L. Mallows . Some comments on c p . Technometrics , 15 ( 4 ): 661 -- 675 , 1973 . C. L. Mallows. Some comments on c p. Technometrics, 15(4):661--675, 1973.","journal-title":"Technometrics"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656041774956"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"key":"e_1_3_2_1_18_1","first-page":"167","volume-title":"SIAM review","author":"Newman M.","year":"2003","unstructured":"M. Newman . The structure and function of complex networks. SIAM review , pages 167 -- 256 , 2003 . M. Newman. The structure and function of complex networks. SIAM review, pages 167--256, 2003."},{"key":"e_1_3_2_1_19_1","volume-title":"Finding and evaluating community structure in networks. Physical review E, 69(2):026113","author":"Newman M. E.","year":"2004","unstructured":"M. E. Newman and M. Girvan . Finding and evaluating community structure in networks. Physical review E, 69(2):026113 , 2004 . M. E. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004."},{"key":"e_1_3_2_1_20_1","first-page":"104","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"Ochoa G.","year":"2010","unstructured":"G. Ochoa , S. Verel , and M. Tomassini . First-improvement vs. best-improvement local optima networks of nk landscapes . In Parallel Problem Solving from Nature, PPSN XI , pages 104 -- 113 . Springer , 2010 . G. Ochoa, S. Verel, and M. Tomassini. First-improvement vs. best-improvement local optima networks of nk landscapes. In Parallel Problem Solving from Nature, PPSN XI, pages 104--113. Springer, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330784.2330845"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6252992"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.066"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0966-8349(95)00008-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.066114"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/040608635"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21706-2","volume-title":"Modern Applied Statistics with S","author":"Venables W. N.","year":"2002","unstructured":"W. N. Venables and B. D. Ripley . Modern Applied Statistics with S . Springer , New York , fourth edition, 2002 . ISBN 0--387--95457-0. W. N. Venables and B. D. Ripley. Modern Applied Statistics with S. Springer, New York, fourth edition, 2002. ISBN 0--387--95457-0."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2046175"},{"key":"e_1_3_2_1_31_1","volume-title":"Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. J. Artif. Intell. Res.(JAIR), 24:221--261","author":"Watson J.-P.","year":"2005","unstructured":"J.-P. Watson , L. D. Whitley , and A. E. Howe . Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. J. Artif. Intell. Res.(JAIR), 24:221--261 , 2005 . J.-P. Watson, L. D. Whitley, and A. E. Howe. Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. J. Artif. Intell. Res.(JAIR), 24:221--261, 2005."}],"event":{"name":"GECCO '14: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Vancouver BC Canada","acronym":"GECCO '14"},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:00Z","timestamp":1750277640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":31,"alternative-id":["10.1145\/2576768.2598275","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598275","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}