{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:46:47Z","timestamp":1773798407981,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"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":[[2023,8,30]]},"DOI":"10.1145\/3594805.3607129","type":"proceedings-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T11:03:28Z","timestamp":1690801408000},"page":"152-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean 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, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"ITIS Software, Universidad de M\u00e1laga, M\u00e1laga, Spain"}]}],"member":"320","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"E. Boros and P.L. Hammer. 2002. Pseudo-Boolean Optimization. Discrete applied mathematics 123 1 (2002) 155--225.","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_1_4_1","volume-title":"17th European Conference on Evolutionary Computation Combinatorial Optimization (EVOCOP). Springer, LNCS.","author":"Chen W.","unstructured":"W. Chen and D. Whitley. 2017. Decomposing SAT instances with pseudo backbones. In 17th European Conference on Evolutionary Computation Combinatorial Optimization (EVOCOP). Springer, LNCS."},{"key":"e_1_3_2_1_5_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 921--928","author":"Chen W.","unstructured":"W. Chen, D.Whitley, F. Chicano, and R. Tin\u00f3s. 2018. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 921--928."},{"key":"e_1_3_2_1_6_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 753--760","author":"Chicano F.","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--760."},{"key":"e_1_3_2_1_7_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 437--444","author":"Chicano F.","unstructured":"F. Chicano, D. Whitley, and A. Sutton. 2014. Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Problems. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 437--444."},{"key":"e_1_3_2_1_8_1","unstructured":"T. Cormen C. Leiserson R. Rivest and C. Stein. 2001. Introduction to Algorithms 2nd Edition. MIT Press New York."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463468"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.478595"},{"key":"e_1_3_2_1_11_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 694--702","author":"Dunton P.","unstructured":"P. Dunton and D. Whitley. 2022. Reducing the cost of partition crossover on large MAXSAT problems: the PX-preprocessor. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 694--702."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_2_1_13_1","unstructured":"H.H. Hoos and Th. St\u00fctzle. 2004. Stochastic Local Search: Foundations and Applications. Morgan Kaufman."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc of AAAI. 661--666","author":"Hoos H.H.","year":"1999","unstructured":"H.H. Hoos. 1999. On the run-time behaviour of stochastic local search algorithms for SAT.. In Proc of AAAI. 661--666."},{"key":"e_1_3_2_1_15_1","volume-title":"AIP Conf Proceedings","author":"Mieskolainen M.","unstructured":"M. Mieskolainen and R. Orava. 2017. Observables of QCD diffraction. In AIP Conf Proceedings, Vol. 1819(1). AIP Publishing."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.1998.0438"},{"key":"e_1_3_2_1_17_1","volume-title":"PPSN (2) (Lecture Notes in Computer Science","author":"Ochoa Gabriela","unstructured":"Gabriela Ochoa and Sebastian Herrmann. 2018. Perturbation Strength and the Global Structure of QAP Fitness Landscapes. In PPSN (2) (Lecture Notes in Computer Science, Vol. 11102). Springer, 245--256."},{"key":"e_1_3_2_1_18_1","volume-title":"PPSN (1) (Lecture Notes in Computer Science","author":"Tin\u00f3s Renato","unstructured":"Renato Tin\u00f3s, Keld Helsgaun, and Darrell Whitley. 2018. Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic. In PPSN (1) (Lecture Notes in Computer Science, Vol. 11101). Springer, 95--107."},{"key":"e_1_3_2_1_19_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--149.","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_21_1","volume-title":"The National Conference on Artificial Intelligence (AAAI). 940--946","author":"Whitley D.","unstructured":"D. Whitley, A. Howe, and D. Hains. 2013. Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT. In The National Conference on Artificial Intelligence (AAAI). 940--946."},{"key":"e_1_3_2_1_22_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 757--765","author":"Whitley D.","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--765."}],"event":{"name":"FOGA '23: Foundations of Genetic Algorithms XVII","location":"Potsdam Germany","acronym":"FOGA '23","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 17th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607129","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3594805.3607129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:01Z","timestamp":1750182541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3594805.3607129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":20,"alternative-id":["10.1145\/3594805.3607129","10.1145\/3594805"],"URL":"https:\/\/doi.org\/10.1145\/3594805.3607129","relation":{},"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"2023-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}