{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:29:29Z","timestamp":1773930569048,"version":"3.50.1"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202025"],"award-info":[{"award-number":["62202025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62122078"],"award-info":[{"award-number":["62122078"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Changsha","award":["kq2202104"],"award-info":[{"award-number":["kq2202104"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tcyb.2022.3199147","type":"journal-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:08:03Z","timestamp":1662408483000},"page":"1403-1416","source":"Crossref","is-referenced-by-count":24,"title":["NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem"],"prefix":"10.1109","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5028-1064","authenticated-orcid":false,"given":"Chuan","family":"Luo","sequence":"first","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2859-2840","authenticated-orcid":false,"given":"Wenqian","family":"Xing","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1730-6922","authenticated-orcid":false,"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3473-9703","authenticated-orcid":false,"given":"Chunming","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2869674"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2931434"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.02.015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900355"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5517"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2731598"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2691772"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1150334.1150336"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.026"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.01.035"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.05.038"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5377-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.06.016"},{"key":"ref15","volume-title":"Applied Mathematical Programming","author":"Bradley","year":"1977"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00348-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_599"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0224-y"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2015.11.575"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2343242"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2346196"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/180"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2849403"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2880256"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2317488"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749.ch19"},{"key":"ref28","volume-title":"Theoretical Aspects of Local Search","author":"Michiels","year":"2007"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2010.38"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.5.730"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-010-0086-y"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90141-X"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.36.6.674"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90215-U"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.6.875"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/060655225"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/080736831"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00159-X"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00161-0"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","article-title":"A morphing procedure to a simulated annealing heuristic for cost- andcoverage-correlated set-covering problems","volume":"86","author":"Brusco","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/189164"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.10.018"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103354"},{"key":"ref49","first-page":"613","article-title":"MaxSAT, hard and soft constraints","volume-title":"Handbook of Satisfiability","author":"Li","year":"2009"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19212-9_3"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5443"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.07.006"},{"key":"ref54","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. NIPS","author":"Khalil"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.9110"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_26"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_12"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.61"},{"key":"ref59","first-page":"321","article-title":"Evidence for invariants in local search","volume-title":"Proc. AAAI","author":"McAllester"},{"key":"ref60","first-page":"655","article-title":"An adaptive noise mechanism for WalkSAT","volume-title":"Proc. AAAI","author":"Hoos"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_3"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1990.166"},{"issue":"1","key":"ref63","first-page":"5","article-title":"On a combinatorial problem","volume":"11","author":"Erd\u00f6s","year":"1963","journal-title":"Nordisk Matematisk Tidskrift"},{"issue":"1","key":"ref64","first-page":"61","article-title":"On some of my favourite problems in graph theory and block designs","volume":"45","author":"Erd\u00f6s","year":"1990","journal-title":"Le Matematiche"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190119"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120689"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref69","volume-title":"Practical Nonparametric Statistics","author":"Conover","year":"1999"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.11.001"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2030331"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114938"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.07.045"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/10431606\/09877844.pdf?arnumber=9877844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T19:14:53Z","timestamp":1708110893000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9877844\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":73,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2022.3199147","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}