{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:40:27Z","timestamp":1743093627239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030729035"},{"type":"electronic","value":"9783030729042"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72904-2_12","type":"book-chapter","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:03:03Z","timestamp":1616756583000},"page":"185-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Symmetry Breaking for Voting Mechanisms"],"prefix":"10.1007","author":[{"given":"Preethi","family":"Sankineni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-30217-9_4","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"P Briest","year":"2004","unstructured":"Briest, P., et al.: The Ising model: simple evolutionary algorithms as adaptation schemes. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 31\u201340. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_4"},{"issue":"1996","key":"12_CR2","first-page":"148","volume":"96","author":"JM Crawford","year":"1996","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. Proc. KR 96(1996), 148\u2013159 (1996)","journal-title":"Proc. KR"},{"key":"12_CR3","unstructured":"Culberson, J.: Genetic invariance: a new paradigm for genetic algorithm design. Technical Report TR92-02, University of Alberta, June 1992"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-58484-6_252","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"AE Eiben","year":"1994","unstructured":"Eiben, A.E., Rau\u00e9, P.-E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 78\u201387. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_252"},{"key":"12_CR5","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":"12_CR6","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. Theor. Comput. Sci. 344(2\u20133), 208\u2013225 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Nallaperuma, S., Neumann, F., Schirneck, M.: Fast building block assembly by majority vote crossover. In: Proceeding of GECCO 2016 (2016)","DOI":"10.1145\/2908812.2908884"},{"key":"12_CR8","unstructured":"Hoyweghen, C.V., Goldberg, D.E., Naudts, B.: From TwoMax to the Ising model: easy and hard symmetrical problems. In: Proceeding of GECCO (2002)"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1162\/106365602760972749","volume":"10","author":"CV Hoyweghen","year":"2002","unstructured":"Hoyweghen, C.V., Naudts, B., Goldberg, D.E.: Spin-flip symmetry and synchronization. Evol. Comput. 10(4), 317\u2013344 (2002)","journal-title":"Evol. Comput."},{"issue":"1","key":"12_CR10","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. Zeitschrift f\u00fcr Physik 31(1), 253\u2013258 (1925)","journal-title":"Zeitschrift f\u00fcr Physik"},{"key":"12_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199233212.001.0001","volume-title":"The Nature of Computation","author":"C Moore","year":"2011","unstructured":"Moore, C., Mertens, S.: The Nature of Computation. Oxford University Press, Oxford (2011)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0056850","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"B Naudts","year":"1998","unstructured":"Naudts, B., Naudts, J.: The effect of spin-flip symmetry on the performance of the simple GA. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 67\u201376. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056850"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0026602","volume-title":"Artificial Evolution","author":"B Naudts","year":"1998","unstructured":"Naudts, B., Verschoren, A.: SGA search dynamics on second order functions. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 207\u2013221. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0026602"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45356-3_38","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"M Pelikan","year":"2000","unstructured":"Pelikan, M., Goldberg, D.E.: Genetic algorithms, clustering, and the breaking of symmetry. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 385\u2013394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_38"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11493853_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S Prestwich","year":"2005","unstructured":"Prestwich, S., Roli, A.: Symmetry breaking and local search spaces. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 273\u2013287. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11493853_21"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10601-004-5306-8","volume":"10","author":"J Puget","year":"2005","unstructured":"Puget, J.: Symmetry breaking revisited. Constraints 10(1), 23\u201346 (2005)","journal-title":"Constraints"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Rowe, J.E.: Aishwaryaprajna: the benefits and limitations of voting mechanisms in evolutionary optimisation. In: Proceeding of FOGA (2019)","DOI":"10.1145\/3299904.3340305"},{"issue":"12","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.dam.2005.10.018","volume":"155","author":"I Shlyakhter","year":"2007","unstructured":"Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. Discrete Appl. Math. 155(12), 1539\u20131548 (2007)","journal-title":"Discrete Appl. Math."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Proceeding of GECCO (2005)","DOI":"10.1145\/1068009.1068202"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-015-0027-5","volume":"75","author":"AM Sutton","year":"2016","unstructured":"Sutton, A.M.: Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. Algorithmica 75(3), 507\u2013528 (2016)","journal-title":"Algorithmica"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-99259-4_5","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"D Whitley","year":"2018","unstructured":"Whitley, D., Varadarajan, S., Hirsch, R., Mukhopadhyay, A.: Exploration and exploitation without mutation: solving the Jump function in $$\\varTheta (n)$$ time. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 55\u201366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_5"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72904-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T23:06:04Z","timestamp":1617231964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72904-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030729035","9783030729042"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72904-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}