{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:03:43Z","timestamp":1780056223092,"version":"3.54.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_32","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"456-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary Algorithms for\u00a0Cardinality-Constrained Ising Models"],"prefix":"10.1007","author":[{"given":"Vijay Dhanjibhai","family":"Bhuva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6660-6625","authenticated-orcid":false,"given":"Duc-Cuong","family":"Dang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liam","family":"Huber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6020-1646","authenticated-orcid":false,"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"6","key":"32_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"10","key":"32_CR2","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A Math. Gen. 15(10), 3241\u20133253 (1982)","journal-title":"J. Phys. A Math. Gen."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bian, C., Feng, C., Qian, C., Yu, Y.: An efficient evolutionary algorithm for subset selection with general cost constraints. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 3267\u20133274. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i04.5726"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Bian, C., Qian, C., Neumann, F., Yu, Y.: Fast pareto optimization for subset selection with dynamic cost constraints. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, pp. 2191\u20132197 (2021)","DOI":"10.24963\/ijcai.2021\/302"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, F., Peng, P., Sudholt, D.: More effective randomized search heuristics for graph coloring through dynamic optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2020), pp. 1277\u20131285. ACM (2020)","DOI":"10.1145\/3377930.3390174"},{"issue":"10","key":"32_CR6","doi-asserted-by":"publisher","first-page":"3148","DOI":"10.1007\/s00453-021-00838-3","volume":"83","author":"J Bossek","year":"2021","unstructured":"Bossek, J., Neumann, F., Peng, P., Sudholt, D.: Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem. Algorithmica 83(10), 3148\u20133179 (2021)","journal-title":"Algorithmica"},{"key":"32_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106027","volume":"88","author":"C Doerr","year":"2020","unstructured":"Doerr, C., Ye, F., Horesh, N., Wang, H., Shir, O.M., B\u00e4ck, T.: Benchmarking discrete optimization heuristics with IOH profiler. Appl. Soft Comput. 88, 106027 (2020)","journal-title":"Appl. Soft Comput."},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1007\/978-3-540-24854-5_108","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"S Fischer","year":"2004","unstructured":"Fischer, S.: A polynomial upper bound for a mutation-based algorithm on the two-dimensional ising model. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3102, pp. 1100\u20131112. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24854-5_108"},{"issue":"2\u20133","key":"32_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.tcs.2005.04.002","volume":"344","author":"S Fischer","year":"2005","unstructured":"Fischer, S., Wegener, I.: The one-dimensional Ising model: mutation versus recombination. Theoret. Comput. Sci. 344(2\u20133), 208\u2013225 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Friedrich, T., G\u00f6bel, A., Neumann, F., Quinzan, F., Rothenberger, R.: Greedy maximization of functions with bounded curvature under partition matroid constraints. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 2272\u20132279. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012272"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2018.04.051","volume":"832","author":"T Friedrich","year":"2020","unstructured":"Friedrich, T., K\u00f6tzing, T., Lagodzinski, J.A.G., Neumann, F., Schirneck, M.: Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints. Theoret. Comput. Sci. 832, 3\u201319 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR12","unstructured":"Goldberg, D.E., Van Hoyweghen, C., Naudts, B.: From TwoMax to the Ising model: easy and hard symmetrical problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 626\u2013633. Morgan Kaufmann (2002)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.matchar.2018.06.019","volume":"147","author":"Y Ikeda","year":"2019","unstructured":"Ikeda, Y., Grabowski, B., K\u00f6rmann, F.: Ab initio phase stabilities and mechanical properties of multicomponent alloys: a comprehensive review for high entropy alloys and compositionally complex alloys. Mater. Charact. 147, 464\u2013511 (2019)","journal-title":"Mater. Charact."},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02980577","volume":"31","author":"E Ising","year":"1925","unstructured":"Ising, E.: Beitrag zur Theorie des Ferromagnetismus. Z. Phys. 31(1), 253\u2013258 (1925)","journal-title":"Z. Phys."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.commatsci.2018.07.043","volume":"163","author":"J Janssen","year":"2019","unstructured":"Janssen, J., et al.: pyiron: an integrated development environment for computational materials science. Comput. Mater. Sci. 163, 24\u201336 (2019)","journal-title":"Comput. Mater. Sci."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Jin, Y., Xiong, B., He, K., Hao, J.-K., Li, C.-M., Fu, Z.-H.: Clustering driven iterated hybrid search for vertex bisection minimization. IEEE Trans. Comput. (2021, Early Access)","DOI":"10.1109\/TC.2021.3128504"},{"issue":"4","key":"32_CR17","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601\u2013640 (1996)","journal-title":"J. ACM"},{"issue":"19","key":"32_CR18","doi-asserted-by":"publisher","first-page":"12587","DOI":"10.1103\/PhysRevB.46.12587","volume":"46","author":"DB Laks","year":"1992","unstructured":"Laks, D.B., Ferreira, L., Froyen, S., Zunger, A.: Efficient cluster expansion for substitutional systems. Phys. Rev. B 46(19), 12587 (1992)","journal-title":"Phys. Rev. B"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/evco_a_00199","volume":"25","author":"S Nallaperuma","year":"2017","unstructured":"Nallaperuma, S., Neumann, F., Sudholt, D.: Expected fitness gains of randomized search heuristics for the traveling salesperson problem. Evol. Comput. 25, 673\u2013705 (2017)","journal-title":"Evol. Comput."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Neumann, F.: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Comput. Oper. Res. 35(9), 2750\u20132759 (2008). ISSN 0305\u20130548","DOI":"10.1016\/j.cor.2006.12.009"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Qian, C., Zhang, Y., Tang, K., Yao, X.: On multiset selection with size constraints. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018), pp. 1395\u20131402. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11524"},{"key":"32_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103597","volume":"302","author":"V Roostapour","year":"2022","unstructured":"Roostapour, V., Neumann, A., Neumann, F., Friedrich, T.: Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302, 103597 (2022)","journal-title":"Artif. Intell."},{"issue":"4","key":"32_CR23","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","volume":"3","author":"J Scharnow","year":"2004","unstructured":"Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithms 3(4), 349\u2013366 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005), pp. 1161\u20131167. ACM Press (2005)","DOI":"10.1145\/1068009.1068202"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-01009-5_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Theile","year":"2009","unstructured":"Theile, M.: Exact solutions to the traveling salesperson problem by a population-based evolutionary algorithm. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 145\u2013155. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01009-5_13"},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jmst.2020.06.018","volume":"62","author":"Y Wu","year":"2021","unstructured":"Wu, Y., et al.: Short-range ordering and its effects on mechanical properties of high-entropy alloys. J. Mater. Sci. Technol. 62, 214\u2013220 (2021)","journal-title":"J. Mater. Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:16Z","timestamp":1710259336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"185","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":"85","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":"46% - 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.75","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":"3.11","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)"}}]}}