{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T04:05:39Z","timestamp":1792123539509,"version":"4.4.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61603367"],"award-info":[{"award-number":["61603367"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61333014"],"award-info":[{"award-number":["61333014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61672478"],"award-info":[{"award-number":["61672478"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Scientists Sponsorship Program by CAST","award":["2016QNRC001"],"award-info":[{"award-number":["2016QNRC001"]}]},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization"},{"name":"Science and Technology Innovation Committee Foundation of Shenzhen","award":["ZDSYS201703031748284"],"award-info":[{"award-number":["ZDSYS201703031748284"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tevc.2017.2749263","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T01:22:28Z","timestamp":1504747348000},"page":"595-608","source":"Crossref","is-referenced-by-count":58,"title":["Constrained Monotone <inline-formula> <tex-math notation=\"LaTeX\">$k$ <\/tex-math> <\/inline-formula>-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6011-2512","authenticated-orcid":false,"given":"Chao","family":"Qian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing-Cheng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6236-2002","authenticated-orcid":false,"given":"Ke","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0746-1494","authenticated-orcid":false,"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846817"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.25"},{"key":"ref31","first-page":"1055","article-title":"On bisubmodular maximization","author":"singh","year":"2012","journal-title":"Proc 14th Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref30","first-page":"1330","article-title":"On greedy maximization of entropy","author":"sharma","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.01.001"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1137\/1.9781611973402.108","article-title":"Maximizing bisubmodular and k-submodular functions","author":"ward","year":"2014","journal-title":"Proc 25th Annu ACM SIAM Symp Discr Algorithms (SODA)"},{"key":"ref34","first-page":"2104","article-title":"Maximizing the coverage of information propagation in social networks","author":"wang","year":"2015","journal-title":"Proc Int Conf Artif Intell (IJCAI)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1140\/epjds5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32147-4_40"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch30"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.4.684"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-5106-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0242-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0006528"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/364"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(01)00323-1"},{"key":"ref27","first-page":"1765","article-title":"Subset selection by Pareto optimization","author":"qian","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref29","first-page":"1939","article-title":"Parallel Pareto optimization for subset selection","author":"qian","year":"2016","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.872344"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103426339"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"key":"ref20","first-page":"1812","article-title":"Lazier than lazy greedy","author":"mirzasoleiman","year":"2015","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9370-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"ref26","first-page":"389","article-title":"On constrained Boolean Pareto optimization","author":"qian","year":"2015","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref25","first-page":"694","article-title":"Monotone k-submodular function maximization with size constraints","author":"ohsaka","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/8423223\/08026144.pdf?arnumber=8026144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:19Z","timestamp":1642004599000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8026144\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":37,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2017.2749263","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}