{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:25:04Z","timestamp":1743157504974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030778750"},{"type":"electronic","value":"9783030778767"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-77876-7_8","type":"book-chapter","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:03:11Z","timestamp":1623625391000},"page":"111-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6172-4801","authenticated-orcid":false,"given":"Alexander","family":"Semenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5209-1803","authenticated-orcid":false,"given":"Ilya","family":"Otpuschennikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0361-2582","authenticated-orcid":false,"given":"Kirill","family":"Antonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2008.03.008","volume":"403","author":"P Borisovsky","year":"2008","unstructured":"Borisovsky, P., Eremeev, A.: Comparing evolutionary algorithms to the (1+1)-EA. Theor. Comput. Sci. 403(1), 33\u201341 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"8_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-Boolean optimization. Discrete Appl. Math. 123(1\u20133), 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Doerr, B.: Runtime analysis of the $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm on random satisfiable 3-cnf formulas. In: Bosman, P.A.N. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, 15\u201319 July, pp. 1343\u20131350. ACM (2017)","DOI":"10.1145\/3071178.3071297"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theor. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Bosman, P.A.N. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, 15\u201319 July, pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Gribanova, I., Semenov, A.: Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4. In: 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pp. 1174\u20131179 (2018)","DOI":"10.23919\/MIPRO.2018.8400213"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gribanova, I., Semenov, A.: Constructing a set of weak values for full-round MD4 hash function. In: 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO), pp. 1212\u20131217 (2020)","DOI":"10.23919\/MIPRO48935.2020.9245337"},{"key":"8_CR10","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 613\u2013631. IOS Press (2009)"},{"key":"8_CR11","unstructured":"Irkutsk Supercomputer Center of SB RAS. http:\/\/hpc.icc.ru"},{"key":"8_CR12","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hillclimbing. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature 2, PPSN-II, Brussels, Belgium, 28\u201330 September, pp. 15\u201326. Elsevier (1992)"},{"key":"8_CR13","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2009). http:\/\/www.bitcoin.org\/bitcoin.pdf"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-319-98334-9_47","volume-title":"Principles and Practice of Constraint Programming","author":"S Nejati","year":"2018","unstructured":"Nejati, S., Hor\u00e1\u010dek, J., Gebotys, C., Ganesh, V.: Algebraic fault attack on sha hash functions using programmatic sat solvers. In: Hooker, J. (ed.) Principles and Practice of Constraint Programming, pp. 737\u2013754. Springer International Publishing, Cham (2018)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-66263-3_16","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"S Nejati","year":"2017","unstructured":"Nejati, S., Newsham, Z., Scott, J., Liang, J.H., Gebotys, C., Poupart, P., Ganesh, V.: A propagation rate based splitting heuristic for divide-and-conquer solvers. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 251\u2013260. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_16"},{"key":"8_CR16","unstructured":"Otpuschennikov, I., Semenov, A., Gribanova, I., Zaikin, O., Kochemazov, S.: Encoding cryptographic functions to SAT using TRANSALG system. In: The 22nd European Conference on Artificial Intelligence (ECAI 2016). Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 1594\u20131595. IOS Press (2016)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Otpuschennikov, I.V., Semenov, A.A.: Using merging variables-based local search to solve special variants of maxsat problem. In: Mathematical Optimization Theory and Operations Research. Communications in Computer and Information Science, vol. 1275, pp. 363\u2013378 (2020)","DOI":"10.1007\/978-3-030-58657-7_29"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-030-16692-2_16","volume-title":"Applications of Evolutionary Computation","author":"A Pavlenko","year":"2019","unstructured":"Pavlenko, A., Semenov, A., Ulyantsev, V.: Evolutionary computation techniques for constructing SAT-based attacks in algebraic Cryptanalysis. In: Kaufmann, P., Castillo, P.A. (eds.) EvoApplications 2019. LNCS, vol. 11454, pp. 237\u2013253. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16692-2_16"},{"key":"8_CR19","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Kova\u010d (1997)"},{"key":"8_CR20","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-33394-2_8","volume-title":"Mathematical Optimization Theory and Operations Research","author":"AA Semenov","year":"2019","unstructured":"Semenov, A.A.: Merging variables: one technique of search in pseudo-Boolean optimization. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds.) MOTOR 2019. CCIS, vol. 1090, pp. 86\u2013102. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33394-2_8"},{"key":"8_CR21","unstructured":"Semenov, A.A., Otpuschennikov, I.V., Gribanova, I., Zaikin, O., Kochemazov, S.: Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems. Log. Methods Comput. Sci. 16(1), 29:1\u201329:42 (2020). https:\/\/dblp.org\/rec\/journals\/lmcs\/SemenovOG0K19.bib"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-48224-5_6","volume-title":"Automata, Languages and Programming","author":"I Wegener","year":"2001","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 64\u201378. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_6"},{"key":"8_CR23","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 1173\u20131178 (2003)"},{"issue":"1","key":"8_CR24","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the ($$\\mu $$ + 1)-EA on simple pseudo-Boolean functions. Evol. Comput. 14(1), 65\u201386 (2006)","journal-title":"Evol. Comput."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Zaikin, O.S., Kochemazov, S.E.: On black-box optimization in divide-and-conquer sat solving. Optim. Method Softw. 1\u201325 (2019)","DOI":"10.1080\/10556788.2019.1685993"}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77876-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:04:45Z","timestamp":1623625485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77876-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778750","9783030778767"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77876-7_8","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":"14 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Irkutsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.icc.ru\/e\/motor2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"102","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":"29","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":"1","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":"28% - 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,4","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":"2,5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}