{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:34Z","timestamp":1740098974653,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811071782"},{"type":"electronic","value":"9789811071799"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-7179-9_35","type":"book-chapter","created":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T23:53:32Z","timestamp":1510098812000},"page":"456-465","source":"Crossref","is-referenced-by-count":0,"title":["Hypervolume-Based Multi-level Algorithm for the Bi-criteria Max-Cut Problem"],"prefix":"10.1007","author":[{"given":"Li-Yuan","family":"Xue","sequence":"first","affiliation":[]},{"given":"Rong-Qiang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Hai-Yun","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zheng-Yin","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,9]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","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. Discrete Appl. Math. 154, 1685\u20131692 (2006)","journal-title":"Discrete Appl. Math."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Arraiz, E., Olivo, O.: Competitive simulated annealing and tabu search algorithms for the max-cut problem. In: Genetic and Evolutionary Computation Conference (GECCO 2009), pp. 1797\u20131798. Springer (2009)","DOI":"10.1145\/1569901.1570167"},{"issue":"2","key":"35_CR3","doi-asserted-by":"crossref","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":"35_CR4","doi-asserted-by":"crossref","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":"35_CR5","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1016\/j.cor.2010.10.007","volume":"38","author":"U Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.-K.: An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38, 1066\u20131075 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"35_CR6","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","volume":"15","author":"U Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.-K.: A multilevel memetic approach for improving graph k-partitions. IEEE Trans. Evol. Comput. 15(2), 624\u2013642 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"35_CR7","doi-asserted-by":"crossref","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":"35_CR8","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)","author":"CA Coello","year":"2007","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 (2007)"},{"key":"35_CR9","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"17","author":"P Festa","year":"2002","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the max-cut problem. Optim. Methods Softw. 17, 1033\u20131058 (2002)","journal-title":"Optim. Methods Softw."},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.asoc.2017.08.024","volume":"61","author":"C He","year":"2017","unstructured":"He, C., Tian, Y., Jin, Y., Zhang, X., Pan, L.: A radial space division based evolutionary algorithm for many-objective optimization. Appl. Soft Comput. 61, 603\u2013621 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"35_CR11","doi-asserted-by":"crossref","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."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Pan, L., He, C., Tian, Y., Su, Y., Zhang, X.: A region division based diversity maintaining approach for many-objective optimization. Integr. Comput. Aided Eng. pp. 1\u201318 (2017)","DOI":"10.3233\/ICA-170542"},{"issue":"5","key":"35_CR13","doi-asserted-by":"crossref","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":"35_CR14","doi-asserted-by":"crossref","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."},{"issue":"2","key":"35_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Cheng, R., Jin, Y.: An efficient approach to non-dominated sorting for evolutionary multi-objective optimization. IEEE Trans. Evol. Comput. 19(2), 201\u2013213 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"35_CR16","first-page":"1","volume":"99","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Tian, Y., Cheng, R., Jin, Y.: A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans. Evol. Comput. 99(1), 1\u201317 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"35_CR17","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Jin, Y.: A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19(6), 761\u2013776 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"35_CR18","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., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"key":"35_CR19","doi-asserted-by":"crossref","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":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-7179-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T00:11:08Z","timestamp":1510099868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-7179-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811071782","9789811071799"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-7179-9_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}