{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:41:51Z","timestamp":1759178511431,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"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":[[2018,7,2]]},"DOI":"10.1145\/3205455.3205482","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"921-928","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Tunneling between plateaus"],"prefix":"10.1145","author":[{"given":"Wenxiang","family":"Chen","sequence":"first","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[{"name":"University of S\u00e3o Paulo, Ribeir\u00e3o Preto, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"The University of M\u00e1laga, M\u00e1laga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190104"},{"volume-title":"International Conference on Theory and Applications of Satisfiability Testing, 238--254","author":"Ans\u00f3tegui C.","key":"e_1_3_2_1_2_1","unstructured":"Ans\u00f3tegui, C.; Gir\u00e1ldez-Cru, J.; Levy, J.; and Simon, L. 2015. Using community structure to detect relevant learnt clauses. In International Conference on Theory and Applications of Satisfiability Testing, 238--254. Springer."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_3"},{"key":"e_1_3_2_1_4_1","unstructured":"Berg J.; J\u00c3d'rvisalo M.; and Malone B. 2014. Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability. In Kaski S. and Corander J. eds. Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics volume 33 of Proceedings of Machine Learning Research 86--95. Reykjavik Iceland: PMLR."},{"issue":"1","key":"e_1_3_2_1_5_1","first-page":"201","article-title":"Decomposing SAT problems into connected components","volume":"2","author":"Biere A.","year":"2006","unstructured":"Biere, A., and Sinz, C. 2006. Decomposing SAT problems into connected components. JSAT 2(1-4):201--208.","journal-title":"JSAT"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2892753.2892788"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061270"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071285"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622776.1622786"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1630659.1630826"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02418571"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1661445.1661532"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2898607.2898628"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768142.1768157"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2346196"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730491"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/22055"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033579"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1867270.1867278"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Tompkins D. A. D. and Hoos H. H. 2005. UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In Revised Selected Papers from the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004) 306--320. 10.1007\/11527695_24","DOI":"10.1007\/11527695_24"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Whitley D.; Howe A. E.; and Hains D. 2013. Greedy or not? best improving versus first improving stochastic local search for maxsat. In desJardins M. and Littman M. L. eds. AAAI. AAAI Press.","DOI":"10.5555\/2891460.2891591"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.001"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570026"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885092"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071305"},{"key":"e_1_3_2_1_30_1","volume-title":"Updated in November 12","author":"Helsgaun K.","year":"2012","unstructured":"Helsgaun, K. (2012b). LKH version 2.0.7. http:\/\/www.akira.ruc.dk\/keld\/research\/LKH\/. Updated in November 12, 2012."},{"key":"e_1_3_2_1_31_1","first-page":"75","volume-title":"Whitley 2017 Decomposing SAT Instances with Pseudo Backbones. In European Conference on Evolutionary Computation in Combinatorial Optimization (EVOCOP)","author":"Chen D.","unstructured":"W. Chen and D. Whitley 2017 Decomposing SAT Instances with Pseudo Backbones. In European Conference on Evolutionary Computation in Combinatorial Optimization (EVOCOP), Springer, pages 75--90."}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Kyoto Japan","acronym":"GECCO '18"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205455.3205482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:56Z","timestamp":1750208936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205482"}},"subtitle":["improving on a state-of-the-art MAXSAT solver using partition crossover"],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":31,"alternative-id":["10.1145\/3205455.3205482","10.1145\/3205455"],"URL":"https:\/\/doi.org\/10.1145\/3205455.3205482","relation":{},"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2018-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}