{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:14:03Z","timestamp":1742955243256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_9","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"125-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Global Landscape Structure and the Random MAX-SAT Phase Transition"],"prefix":"10.1007","author":[{"given":"Gabriela","family":"Ochoa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Tomassini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"9_CR1","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 331\u2013337. Morgan Kaufmann (1991)"},{"key":"9_CR2","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: National Conference on Artificial intelligence (AAAI), pp. 459\u2013465 (1992)"},{"issue":"5163","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S Kirkpatrick","year":"1994","unstructured":"Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random Boolean expressions. Science 264(5163), 1297\u20131301 (1994)","journal-title":"Science"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Whitley, L.D., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 365\u2013372. ACM (2009)","DOI":"10.1145\/1569901.1569952"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, W.: Configuration landscape analysis and backbone guided local search. Part I: Satisfiability and maximum satisfiability. Artif. Intell. 158 1\u201326 (2004)","DOI":"10.1016\/j.artint.2004.04.001"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1613\/jair.445","volume":"7","author":"J Frank","year":"1997","unstructured":"Frank, J., Cheeseman, P., Stutz, J.: When gravity fails: local search topology. J. Artif. Intell. Res. 7, 249\u2013281 (1997)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9_CR7","first-page":"321","volume":"117","author":"CM Reidys","year":"2001","unstructured":"Reidys, C.M., Stadler, P.F.: Neutrality in fitness landscapes. Appl. Math. Comput. 117(2), 321\u2013350 (2001)","journal-title":"Appl. Math. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Tomassini, M., Verel, S., Darabos, C.: A study of NK landscapes\u2019 basins and local optima networks. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 555\u201356. ACM (2008)","DOI":"10.1145\/1389095.1389204"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TEVC.2010.2046175","volume":"15","author":"S Verel","year":"2011","unstructured":"Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. Evol. Comput. 15(6), 783\u2013797 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-55453-2_16","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2017","unstructured":"Ochoa, G., Veerapen, N., Daolio, F., Tomassini, M.: Understanding phase transitions with local optima networks: number partitioning as a case study. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 233\u2013248. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55453-2_16"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-35533-2_5","volume-title":"Artificial Evolution","author":"S V\u00e9rel","year":"2012","unstructured":"V\u00e9rel, S., Daolio, F., Ochoa, G., Tomassini, M.: Local optima networks with escape edges. In: Hao, J.-K., Legrand, P., Collet, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol. 7401, pp. 49\u201360. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35533-2_5"},{"key":"9_CR12","first-page":"187","volume":"117","author":"PF Stadler","year":"2002","unstructured":"Stadler, P.F.: Fitness landscapes. Appl. Math. Comput. 117, 187\u2013207 (2002)","journal-title":"Appl. Math. Comput."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 320\u2013353 (2003)","DOI":"10.1007\/0-306-48056-5_11"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, L.D., Ochoa, G., Tinos, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference, pp. 753\u2013760. ACM (2017)","DOI":"10.1145\/3071178.3071285"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 521\u2013532 (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"issue":"5","key":"9_CR16","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. Int. J. Complex Syst. 1695(5), 1\u20139 (2006)","journal-title":"Int. J. Complex Syst."},{"issue":"14","key":"9_CR17","doi-asserted-by":"publisher","first-page":"6896","DOI":"10.1063\/1.478595","volume":"110","author":"JPK Doye","year":"1999","unstructured":"Doye, J.P.K., Miller, M.A., Wales, D.J.: The double-funnel energy landscape of the 38-atom Lennard-Jones cluster. J. Chem. Phys. 110(14), 6896\u20136906 (1999)","journal-title":"J. Chem. Phys."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-30217-9_6","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., Smyth, K., St\u00fctzle, T.: Search space features underlying the performance of stochastic local search algorithms for MAX-SAT. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 51\u201360. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30217-9_6"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/TEVC.2011.2163638","volume":"16","author":"A Prugel-Bennett","year":"2011","unstructured":"Prugel-Bennett, A., Tayarani-Najaran, M.H.: Maximum satisfiability: Anatomy of the fitness landscape for a hard combinatorial optimization problem. IEEE Trans. Evol. Comput. 16(3), 319\u2013338 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-03751-1_3","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"AM Sutton","year":"2009","unstructured":"Sutton, A.M., Howe, A.E., Whitley, L.D.: Estimating bounds on expected plateau size in MAXSAT problems. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009. LNCS, vol. 5752, pp. 31\u201345. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03751-1_3"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1057\/jors.2010.116","volume":"62","author":"D Hains","year":"2011","unstructured":"Hains, D., Whitley, L.D., Howe, A.E.: Revisiting the big valley search space structure in the TSP. JORS 62(2), 305\u2013312 (2011)","journal-title":"JORS"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-99259-4_20","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"G Ochoa","year":"2018","unstructured":"Ochoa, G., Herrmann, S.: Perturbation strength and the global structure of QAP fitness Landscapes. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 245\u2013256. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99259-4_20"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:05:17Z","timestamp":1598997917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}