{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T22:21:36Z","timestamp":1787437296365,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362223","type":"print"},{"value":"9783032362230","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-36223-0_8","type":"book-chapter","created":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:45:27Z","timestamp":1787435127000},"page":"120-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Multi-child Recombination for\u00a0Bi-objective NK Landscapes: A Comparison to\u00a0Exact Pareto Fronts"],"prefix":"10.1007","author":[{"given":"Surendra","family":"Kurivella","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Cecere","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bilel","family":"Derbel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,23]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Cecere, F., Derbel, B., Whitley, D., Kurivella, S.: Gray-box enhanced decomposition-based local search for multi-objective NK-landscapes. In: Evolutionary Computation in Combinatorial Optimization \u2013 26th European Conference, EvoCOP 2026. Lecture Notes in Computer Science, vol. 16522, pp. 35\u201351. Springer, Cham (2026)","DOI":"10.1007\/978-3-032-20537-7_3"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-55453-2_6","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"W Chen","year":"2017","unstructured":"Chen, W., Whitley, D.: Decomposing SAT Instances with Pseudo Backbones. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 75\u201390. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_6"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Whitley, D., Tin\u00f3s, R., Chicano, F.: Tunneling between Plateaus: Improving on a state-of-the-art MAXSAT Solver using Partition Crossover. In: GECCO Genetic and Evolutionay Computation Conference, pp. 921\u2013928. ACM (2018)","DOI":"10.1145\/3205455.3205482"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Ochoa, G., Tin\u00f3s, R.: Optimizing one million variable nk landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 753\u2013760. ACM (2017)","DOI":"10.1145\/3071178.3071285"},{"issue":"2\u20133","key":"8_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y Crama","year":"1990","unstructured":"Crama, Y., Hansen, P., Jaumard, B.: The basic algorithm for pseudo-boolean programming revisited. Discr. App. Maths. 29(2\u20133), 171\u2013185 (1990)","journal-title":"Discr. App. Maths."},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR7","first-page":"359","volume":"14","author":"P Hammer","year":"1963","unstructured":"Hammer, P., Rosenberg, I., Rudeanu, S.: On the determination of the minima of pseudo-boolean functions. Stud. Cerc. Mat. 14, 359\u2013364 (1963). (in Romanian)","journal-title":"Stud. Cerc. Mat."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kauffman, S.A.: Origins of order: Self-organization and selection in evolution, Oxford University Press (1993)","DOI":"10.1093\/oso\/9780195079517.001.0001"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Kurivella, S., Whitley, D., Chicano, F., Ochoa, G., Cecere, F., Derbel, B.: Gray-box bi-objective boolean optimization using deterministic recombination with iterated local search. In: Krejca, M.S., Pillay, N. (eds.) Evolutionary Computation in Combinatorial Optimization \u2013 26th European Conference, EvoCOP 2026. Lecture Notes in Computer Science, vol. 16522, pp. 101\u2013116. Springer, Cham (2026). https:\/\/doi.org\/10.1007\/978-3-032-20537-7_7","DOI":"10.1007\/978-3-032-20537-7_7"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Anthony, M., Boros, E., Gruber, Y.C., A.: Quadratic reformulations of nonlinear binary optimization problems. Math. Program. (2016)","DOI":"10.1007\/s10107-016-1032-4"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Whitley, D., Chen, W.: Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1357\u20131364. ACM (2012)","DOI":"10.1145\/2330163.2330351"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36223-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:45:28Z","timestamp":1787435128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36223-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,23]]},"ISBN":["9783032362223","9783032362230"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36223-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,23]]},"assertion":[{"value":"23 August 2026","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":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}