{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:36:55Z","timestamp":1759883815590,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T00:00:00Z","timestamp":1752364800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2426840"],"award-info":[{"award-number":["2426840"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712256.3726340","type":"proceedings-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T12:28:18Z","timestamp":1751977698000},"page":"836-844","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["How Partition Crossover Exposes Parallel Lattices and the Fractal Structure of k-Bounded Functions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2752-6534","authenticated-orcid":false,"given":"Darrell","family":"Whitley","sequence":"first","affiliation":[{"name":"Colorado State University, Fort Collins, Colorado, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[{"name":"University of Stirling, Stirling, Scotland, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"ITIS Software, University of Malaga, M\u00e1laga, Spain"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04244-7_13"},{"key":"e_1_3_2_1_2_1","first-page":"387","article-title":"Towards IndustrialLike Random SAT Instances","volume":"9","author":"Ans\u00f3tegui Carlos","year":"2009","unstructured":"Carlos Ans\u00f3tegui, Maria Luisa Bonet, and Jordi Levy. 2009. Towards IndustrialLike Random SAT Instances. In IJCAI, Vol. 9. 387\u2013392.","journal-title":"IJCAI"},{"key":"e_1_3_2_1_3_1","unstructured":"K. D. Boese A. B. Kahng and S. Muddu. 1993. On the big valley and adaptive multistart for discrete global optimizations. Technical Report. UCLA CS Department."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"E. Boros and P.L. Hammer. 2002. Pseudo-Boolean Optimization. Discrete applied mathematics 123 1 (2002) 155\u2013225.","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528774"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590466"},{"volume-title":"Discovering and Harnessing Structures in Solving Application Satisfiability Instances. Ph. D. Dissertation","author":"Chen W.","key":"e_1_3_2_1_8_1","unstructured":"W. Chen. 2018. Discovering and Harnessing Structures in Solving Application Satisfiability Instances. Ph. D. Dissertation. University Tech."},{"volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 753\u2013760","author":"Chicano F.","key":"e_1_3_2_1_9_1","unstructured":"F. Chicano, D. Whitley, G. Ochoa, and R. Tin\u00f3s. 2017. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 753\u2013760."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622776.1622786"},{"volume-title":"Hyperplane Elimination for Quickly Enumerating Local Optima. In European Conference on Evolutionary Computation in Combinatorial Optimization. Springer LNCS.","author":"Goldman B.","key":"e_1_3_2_1_11_1","unstructured":"B. Goldman and W. Punch. 2016. Hyperplane Elimination for Quickly Enumerating Local Optima. In European Conference on Evolutionary Computation in Combinatorial Optimization. Springer LNCS."},{"key":"e_1_3_2_1_12_1","unstructured":"H.H. Hoos and Th. St\u00fctzle. 2004. Stochastic Local Search: Foundations and Applications. Morgan Kaufman."},{"key":"e_1_3_2_1_13_1","volume-title":"International Conference on Genetic Algorithms (ICGA 95)","author":"Jones Terry","year":"1995","unstructured":"Terry Jones and Stephanie Forrest. 1995. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In International Conference on Genetic Algorithms (ICGA 95)."},{"volume-title":"Lectures in the Science of Complexity","author":"Kauffman S.A.","key":"e_1_3_2_1_14_1","unstructured":"S.A. Kauffman. 1989. Adaptation on Rugged Fitness Landscapes. In Lectures in the Science of Complexity, D.L. Stein (Ed.). Addison-Wesley, 527\u2013618."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(87)80029-2"},{"volume-title":"Origins of order: Self-organization and selection in evolution","author":"Kauffman Stuart A.","key":"e_1_3_2_1_16_1","unstructured":"Stuart A. Kauffman. 1993. Origins of order: Self-organization and selection in evolution. Oxford University Press."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908983"},{"key":"e_1_3_2_1_18_1","volume-title":"SAT","author":"Lin C","year":"2007","unstructured":"C Lin, W Wei, and H Zhang. 2007. Combining adaptive noise and look-ahead in local search for SAT.. In SAT 2007. Springer, 121\u2013133."},{"volume-title":"Spin glass theory and beyond: An introduction to the replica method and its applications","author":"Mezard Marc","key":"e_1_3_2_1_19_1","unstructured":"Marc Mezard, Giorgio Parisi, and Miguel A Virasoro. 1987. Spin glass theory and beyond: An introduction to the replica method and its applications. Vol. 9. World Scientific."},{"volume-title":"The Algorithmic Beauty of Plants","author":"Prusinkiewicz Przemyslaw","key":"e_1_3_2_1_20_1","unstructured":"Przemyslaw Prusinkiewicz and Aristid Lindenmayer. 2012. The Algorithmic Beauty of Plants. Springer Science & Business Media."},{"volume-title":"The National Conference on Artificial Intelligence (AAAI)","author":"Selman B.","key":"e_1_3_2_1_21_1","unstructured":"B. Selman, H. Levesque, and D. Mitchell. 1992. A New Method for Solving Hard Satisfiability Problems. In The National Conference on Artificial Intelligence (AAAI). San Jose, CA, 440\u2013446."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759051"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"R. Tin\u00f3s D. Whitley and F. Chicano. 2015. Partition Crossover for Pseudo-Boolean Optimization. In Foundations of Genetic Algorithms (FOGA-15). 137\u2013149.","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"R. Tinos D. Whitley and F. Chicano. 2015. Partition Crossover for Pseudo-Boolean Optimization. In Foundations of Genetic Algorithms. ACM Press 137\u2013149.","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_25_1","volume-title":"Correlated and Uncorrelated Landscapes and How to Tell the Difference. Biological Cybernetics","author":"Weinberger E.","year":"1990","unstructured":"E. Weinberger. 1990. Correlated and Uncorrelated Landscapes and How to Tell the Difference. Biological Cybernetics (1990)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1993.1120"},{"volume-title":"Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 1357\u20131364","author":"Whitley D.","key":"e_1_3_2_1_27_1","unstructured":"D. Whitley and W. Chen. 2012. Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 1357\u20131364."},{"volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 757\u2013765","author":"Whitley D.","key":"e_1_3_2_1_28_1","unstructured":"D. Whitley and G. Ochoa. 2022. Local optima organize into lattices under recombination: an example using the traveling salesman problem. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 757\u2013765."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"D. Whitley G. Ochoa and F. Chicano. 2023. Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions. In Foundations of Genetic Algorithms. ACM.","DOI":"10.1145\/3594805.3607129"}],"event":{"name":"GECCO '25: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712256.3726340","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712256.3726340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T20:41:27Z","timestamp":1759869687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712256.3726340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":29,"alternative-id":["10.1145\/3712256.3726340","10.1145\/3712256"],"URL":"https:\/\/doi.org\/10.1145\/3712256.3726340","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}