{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T04:26:00Z","timestamp":1745900760953,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031453915"},{"type":"electronic","value":"9783031453922"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45392-2_2","type":"book-chapter","created":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T20:17:29Z","timestamp":1697055449000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Genetic Algorithms with Optimality Cuts to the Max-Cut Problem"],"prefix":"10.1007","author":[{"given":"Pablo Luiz Braga","family":"Soares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos Victor Dantas","family":"Ara\u00fajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,12]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Rajagopalan, S., Srikant, R., Xu, Y.: Mining newsgroups using networks arising from social behavior. In: Proceedings of the 12th international conference on World Wide Web, pp. 529\u2013535 (2003)","DOI":"10.1145\/775224.775227"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.cie.2017.07.012","volume":"111","author":"B Alidaee","year":"2017","unstructured":"Alidaee, B., Sloan, H., Wang, H.: Simple and fast novel diversification approach for the UBQP based on sequential improvement local search. Comput. Ind. Eng. 111, 164\u2013175 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F Barahona","year":"1983","unstructured":"Barahona, F.: The max-cut problem on graphs not contractible to K5. Oper. Res. Lett. 2(3), 107\u2013111 (1983)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493\u2013513 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.geb.2005.12.006","volume":"58","author":"Y Bramoull\u00e9","year":"2007","unstructured":"Bramoull\u00e9, Y.: Anti-coordination and social interactions. Games Econom. Behav. 58(1), 30\u201349 (2007)","journal-title":"Games Econom. Behav."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Burer, S., Monteiro, R., Zhang, Y.: Rank-two relaxation heuristic for max-cut and other binary quadratic problems. SIAM J. Optim. 12(2), 503\u2013521 (2001\/2002)","DOI":"10.1137\/S1052623400382467"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.3390\/electronics10030285","volume":"10","author":"KT Chui","year":"2021","unstructured":"Chui, K.T., Gupta, B.B., Vasant, P.: A genetic algorithm optimized RNN-LSTM model for remaining useful life prediction of turbofan engine. Electronics 10(3), 285 (2021)","journal-title":"Electronics"},{"issue":"12","key":"2_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C De Simone","year":"1995","unstructured":"De Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm. J. Stat. Phys. 80(12), 487\u2013496 (1995)","journal-title":"J. Stat. Phys."},{"issue":"13","key":"2_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1080\/10556789408805564","volume":"3","author":"C De Simone","year":"1994","unstructured":"De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optim. Methods Softw. 3(13), 195\u2013214 (1994)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/ijoc.2017.0798","volume":"30","author":"I Dunning","year":"2018","unstructured":"Dunning, I., Gupta, S., Silberholz, J.: What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO. INFORMS J. Comput. 30(3), 608\u2013624 (2018)","journal-title":"INFORMS J. Comput."},{"issue":"52","key":"2_CR11","doi-asserted-by":"publisher","first-page":"20953","DOI":"10.1073\/pnas.1109521108","volume":"108","author":"G Facchetti","year":"2011","unstructured":"Facchetti, G., Iacono, G., Altafini, C.: Computing global structural balance in large-scale signed social networks. Proc. Natl. Acad. Sci. 108(52), 20953\u201320958 (2011)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-011-0983-3","volume":"191","author":"P Galinier","year":"2011","unstructured":"Galinier, P., Boujbel, Z., Fernandes, M.: An efficient memetic algorithm for the graph partitioning problem. Annals OR 191, 1\u201322 (2011)","journal-title":"Annals OR"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Cham (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR15","unstructured":"Kim, S.H., Kim, Y.H., Moon, B.R.: A hybrid genetic algorithm for the MAX CUT problem. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, pp. 416\u2013423. Morgan Kaufmann Publishers Inc. (2001)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.swevo.2018.01.004","volume":"44","author":"YH Kim","year":"2019","unstructured":"Kim, Y.H., Yoon, Y., Geem, Z.W.: A comparison study of harmony search and genetic algorithm for the MAX-CUT problem. Swarm Evol. Comput. 44, 130\u2013135 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10732-011-9189-8","volume":"19","author":"GA Kochenberger","year":"2013","unstructured":"Kochenberger, G.A., Hao, J.K., L\u00fc, Z., Wang, H., Glover, F.: Solving large scale Max Cut problems via tabu search. J. Heuristics 19(4), 565\u2013571 (2013)","journal-title":"J. Heuristics"},{"issue":"6","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TCSS.2019.2939841","volume":"6","author":"N Kolli","year":"2019","unstructured":"Kolli, N., Narayanaswamy, B.: Influence maximization from cascade information traces in complex networks in the absence of network structure. IEEE Trans. Comput. Soc. Syst. 6(6), 1147\u20131155 (2019)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"1\u20132","key":"2_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10107-012-0594-z","volume":"143","author":"N Krislock","year":"2014","unstructured":"Krislock, N., Malick, J., Rouoin, F.: Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Math. Program. 143(1\u20132), 61\u201386 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10479-016-2234-0","volume":"248","author":"F Ma","year":"2017","unstructured":"Ma, F., Hao, J.K.: A multiple search operator heuristic for the max-k-cut problem. Ann. Oper. Res. 248(1\u20132), 365\u2013403 (2017)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R Mart\u00ed","year":"2009","unstructured":"Mart\u00ed, R., Duarte, A., Laguna, M.: Advanced scatter search for the Max-Cut problem. INFORMS J. Comput. 21(1), 26\u201338 (2009)","journal-title":"INFORMS J. Comput."},{"key":"2_CR22","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-93025-1_4","volume-title":"Evolutionary Algorithms and Neural Networks","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili, S.: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks. SCI, vol. 780, pp. 43\u201355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-93025-1_4"},{"key":"2_CR23","unstructured":"Myklebust, T.G.: Solving maximum cut problems by simulated annealing. arXiv preprint (2015)"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.4018\/IJSSCI.2019010103","volume":"11","author":"A Pandey","year":"2019","unstructured":"Pandey, A., Banerjee, S.: Test suite optimization using firefly and genetic algorithm. Int. J. Softw. Sci. Comput. Intell. (IJSSCI) 11(1), 31\u201346 (2019)","journal-title":"Int. J. Softw. Sci. Comput. Intell. (IJSSCI)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"F Rendl","year":"2007","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 295\u2013309. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_23"},{"issue":"2","key":"2_CR26","first-page":"65","volume":"1","author":"L Sun","year":"2010","unstructured":"Sun, L., Cheng, X., Liang, Y.: Solving job shop scheduling problem using genetic algorithm with penalty function. Int. J. Intell. Inf. Process. 1(2), 65\u201377 (2010)","journal-title":"Int. J. Intell. Inf. Process."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-32964-7_30","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J.-K.: A memetic approach for the Max-Cut problem. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7492, pp. 297\u2013306. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32964-7_30"}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45392-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:45:41Z","timestamp":1710348341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45392-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453915","9783031453922"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45392-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belo Horizonte","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.bracis.dcc.ufmg.br","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":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"242","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":"90","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":"37% - 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":"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":"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)"}}]}}