{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:37Z","timestamp":1743095257361,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031138690"},{"type":"electronic","value":"9783031138706"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-13870-6_10","type":"book-chapter","created":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T09:03:13Z","timestamp":1660467793000},"page":"123-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem"],"prefix":"10.1007","author":[{"given":"Rong-Qiang","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Basseur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.dam.2006.02.008","volume":"154","author":"E Angel","year":"2006","unstructured":"Angel, E., Gourves, E.: Approximation algorithms for the bi-criteria weighted max-cut problem. Discret. Appl. Math. 154, 1685\u20131692 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10732-011-9178-y","volume":"18","author":"M Basseur","year":"2012","unstructured":"Basseur, M., Liefooghe, A., Le, K., Burke, E.: The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18(2), 263\u2013296 (2012)","journal-title":"J. Heuristics"},{"issue":"8","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1007\/s00521-011-0588-4","volume":"21","author":"M Basseur","year":"2012","unstructured":"Basseur, M., Zeng, R.-Q., Hao, J.-K.: Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8), 1917\u20131929 (2012)","journal-title":"Neural Comput. Appl."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the max-cut problem. Eng. Appl. Artif. Intell. 26, 1162\u20131173 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation). Springer-Verlag New York, Inc., Secaucus, NJ, USA (2007). https:\/\/doi.org\/10.1007\/978-0-387-36797-2","DOI":"10.1007\/978-0-387-36797-2"},{"key":"10_CR6","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., Glover, F., Hao, J.-K., L\u00fc, Z., Wang, H., Glover, F.: Solving large scale max cut problems via tabu search. J. Heuristics 19, 565\u2013571 (2013)","journal-title":"J. Heuristics"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R Marti","year":"2009","unstructured":"Marti, 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."},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/s10559-010-9256-4","volume":"46","author":"VP Shylo","year":"2010","unstructured":"Shylo, V.P., Shylo, O.V.: Solving the maxcut problem by the global equilibrium search. Cybern. Syst. Anal. 46(5), 744\u2013754 (2010)","journal-title":"Cybern. Syst. Anal."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.cor.2012.06.001","volume":"40","author":"Q Wu","year":"2013","unstructured":"Wu, Q., Hao, J.-K.: Memetic search for the max-bisection problem. Comput. Oper. Res. 40, 166\u2013179 (2013)","journal-title":"Comput. Oper. Res."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.asoc.2015.04.033","volume":"34","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Wang, Y., L\u00fc, Z.: A tabu search based hybrid evolutionary algorithm for the max-cut problem. Appl. Soft Comput. 34, 827\u2013837 (2015)","journal-title":"Appl. Soft Comput."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. Evol. Comput. 3, 257\u2013271 (1999)","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13870-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:55:05Z","timestamp":1709830505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13870-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138690","9783031138706"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13870-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","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":"209","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":"47% - 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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}