{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:42:22Z","timestamp":1761597742732,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2016,9,19]],"date-time":"2016-09-19T00:00:00Z","timestamp":1474243200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61272208","61402196"],"award-info":[{"award-number":["61272208","61402196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00521-016-2599-7","type":"journal-article","created":{"date-parts":[[2016,9,19]],"date-time":"2016-09-19T09:18:47Z","timestamp":1474276727000},"page":"755-765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A restart local search algorithm for solving maximum set k-covering problem"],"prefix":"10.1007","volume":"29","author":[{"given":"Yiyuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dantong","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,19]]},"reference":[{"key":"2599_CR1","first-page":"697","volume":"9","author":"B Saha","year":"2009","unstructured":"Saha B, Getoor L (2009) On maximum coverage in the streaming model & application to multi-topic blog-watch. SDM 9:697\u2013708","journal-title":"SDM"},{"issue":"6","key":"2599_CR2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.omega.2005.01.013","volume":"34","author":"J Bautista","year":"2006","unstructured":"Bautista J, Pereira J (2006) Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona. Omega 34(6):617\u2013629","journal-title":"Omega"},{"key":"2599_CR3","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kumar R, Tomkins A (2010) Max-cover in map-reduce. In: Proceedings of the 19th international conference on World wide web. ACM, 2010: 231\u2013240","DOI":"10.1145\/1772690.1772715"},{"key":"2599_CR4","doi-asserted-by":"crossref","unstructured":"Yu H, Yuan D (2013) Set coverage problems in a one-pass data stream. In: Proceedings of the 2013 SIAM international conference on data mining, pp 758-766","DOI":"10.1137\/1.9781611972832.84"},{"key":"2599_CR5","doi-asserted-by":"crossref","unstructured":"Stergiou S, Tsioutsiouliklis K (2015) Set cover at web scale. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, 2015: 1125\u20131133","DOI":"10.1145\/2783258.2783315"},{"key":"2599_CR6","doi-asserted-by":"crossref","unstructured":"Dasgupta A, Ghosh A, Kumar R et al (2007) The discoverability of the web. In: Proceedings of the 16th international conference on World Wide Web. ACM, 2007: 421\u2013430","DOI":"10.1145\/1242572.1242630"},{"issue":"80","key":"2599_CR7","first-page":"1","volume":"24","author":"W Yiyuan","year":"2016","unstructured":"Yiyuan W, Jianan W (2016) An effective local search algorithm for a special hitting set problem. Transylv Rev 24(80):1\u201312","journal-title":"Transylv Rev"},{"key":"2599_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"RG Michael","year":"1979","unstructured":"Michael RG, David SJ (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Free. Co., San Fr"},{"issue":"4","key":"2599_CR9","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1007\/s00500-015-1594-8","volume":"20","author":"X Li","year":"2016","unstructured":"Li X, Yin M (2016) A particle swarm inspired cuckoo search algorithm for real parameter optimization. Soft Comput 20(4):1389\u20131413","journal-title":"Soft Comput"},{"issue":"4","key":"2599_CR10","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/TEM.2015.2453264","volume":"62","author":"X Li","year":"2015","unstructured":"Li X, Li M (2015) Multiobjective local search algorithm-based decomposition for multiobjective permutation flow shop scheduling problem. IEEE Trans Eng Manage 62(4):544\u2013557","journal-title":"IEEE Trans Eng Manage"},{"key":"2599_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2339-z","author":"X Zhang","year":"2016","unstructured":"Zhang X, Li X, Wang J (2016) Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Comput Appl. doi: 10.1007\/s00521-016-2339-z","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"2599_CR12","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s00521-012-1285-7","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Yin M (2014) Self-adaptive constrained artificial bee colony for constrained numerical optimization. Neural Comput Appl 24(3\u20134):723\u2013734","journal-title":"Neural Comput Appl"},{"issue":"6","key":"2599_CR13","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s00521-013-1354-6","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Wang J, Yin M (2014) Enhancing the performance of cuckoo search algorithm using orthogonal learning method. Neural Comput Appl 24(6):1233\u20131247","journal-title":"Neural Comput Appl"},{"issue":"7\u20138","key":"2599_CR14","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1007\/s00521-013-1433-8","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7\u20138):1867\u20131877","journal-title":"Neural Comput Appl"},{"issue":"3","key":"2599_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-014-5154-0","volume":"58","author":"J Gao","year":"2015","unstructured":"Gao J, Wang JN, Yin MH (2015) Experimental analyses on phase transitions in compiling satisfiability problems. Sci China Inf Sci 58(3):1\u201311","journal-title":"Sci China Inf Sci"},{"issue":"2","key":"2599_CR16","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/s10878-014-9773-6","volume":"31","author":"X Li","year":"2016","unstructured":"Li X, Yin M (2016) Modified differential evolution with self-adaptive parameters method. J Comb Optim 31(2):546\u2013576","journal-title":"J Comb Optim"},{"key":"2599_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2429-y","author":"R Li","year":"2016","unstructured":"Li R, Hu S, Gao J et al (2016) GRASP for connected dominating set problems. Neural Comput Appl. doi: 10.1007\/s00521-016-2429-y","journal-title":"Neural Comput Appl"},{"issue":"1","key":"2599_CR18","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1166\/jctn.2016.4869","volume":"13","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Zhang H, Li R et al (2016) Two local search algorithms for partition vertex cover problem. J Comput Theor Nanosci 13(1):743\u2013751","journal-title":"J Comput Theor Nanosci"},{"issue":"11","key":"2599_CR19","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"5","key":"2599_CR20","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva JP, Sakallah KA (1999) GRASP: a search algorithm for propositional satisfiability. IEEE Trans Comput 48(5):506\u2013521","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"2599_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna M, Marti R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. Inf J Comput 11(1):44\u201352","journal-title":"Inf J Comput"},{"issue":"6","key":"2599_CR22","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/0305-0548(95)00063-1","volume":"23","author":"CR Houck","year":"1996","unstructured":"Houck CR, Joines JA, Kay MG (1996) Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Comput Oper Res 23(6):587\u2013596","journal-title":"Comput Oper Res"},{"key":"2599_CR23","doi-asserted-by":"crossref","unstructured":"Shin K, Jung J, Lee S et al (2015) BEAR: block elimination approach for random walk with restart on large graphs. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM, 2015: 1571\u20131585","DOI":"10.1145\/2723372.2723716"},{"issue":"12","key":"2599_CR24","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/LCOMM.2010.101210.101587","volume":"14","author":"T Datta","year":"2010","unstructured":"Datta T, Srinidhi N, Chockalingam A et al (2010) Random-restart reactive tabu search algorithm for detection in large-MIMO systems. Commun Lett IEEE 14(12):1107\u20131109","journal-title":"Commun Lett IEEE"},{"key":"2599_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6","author":"Y Wang","year":"2016","unstructured":"Wang Y, Li R, Zhou Y et al (2016) A path cost-based GRASP for minimum independent dominating set problem. Neural Comput Appl. doi: 10.1007\/s00521-016-2324-6","journal-title":"Neural Comput Appl"},{"issue":"3","key":"2599_CR26","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"2599_CR27","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"2599_CR28","doi-asserted-by":"publisher","unstructured":"Ruizhi L, Shuli H, Yiyuan W, Minghao Y, A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Comput Appl. doi: 10.1007\/s00521-015-2172-9","DOI":"10.1007\/s00521-015-2172-9"},{"key":"2599_CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai S, Su K (2013) Local search for Boolean Satisfiability with configuration checking and subscore. Artif Intell 204:75\u201398","journal-title":"Artif Intell"},{"key":"2599_CR30","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Yin M (2016) Two efficient local search algorithms for maximum weight clique problem. Thirtieth AAAI Conf Artif Intell, pp 805\u2013811","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"2599_CR31","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12280","author":"Y Wang","year":"2016","unstructured":"Wang Y, Yin M, Ouyang D et al (2016) A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem. Int Trans Oper Res. doi: 10.1111\/itor.12280","journal-title":"Int Trans Oper Res"},{"issue":"11","key":"2599_CR32","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"2599_CR33","volume-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","author":"E Balas","year":"1980","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Springer, Berlin Heidelberg"},{"issue":"1","key":"2599_CR34","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley JE (1987) An algorithm for set covering problem. Eur J Oper Res 31(1):85\u201393","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2599_CR35","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL) 37(1):151\u2013164","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"2599_CR36","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2015.05.038","volume":"246","author":"C Gao","year":"2015","unstructured":"Gao C, Yao X, Weise T et al (2015) An efficient local search heuristic with row weighting for the unicost set covering problem. Eur J Oper Res 246(3):750\u2013761","journal-title":"Eur J Oper Res"},{"key":"2599_CR37","first-page":"10","volume":"2015","author":"Y Wang","year":"1007","unstructured":"Wang Y, Ouyang DT, Zhang L et al (1007) A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci China Inf Sci 2015:10","journal-title":"Sci China Inf Sci"},{"issue":"2","key":"2599_CR38","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2016","unstructured":"Xia Z, Wang X, Sun X et al (2016) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2599_CR39","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2506573","author":"Z Fu","year":"2015","unstructured":"Fu Z, Ren K, Shu J et al (2015) Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans Parallel Distrib Syst. doi: 10.1109\/TPDS.2015.2506573","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"2599_CR40","first-page":"190","volume":"98","author":"F Zhangjie","year":"2015","unstructured":"Zhangjie F, Xingming S, Qi L et al (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun 98(1):190\u2013200","journal-title":"IEICE Trans Commun"},{"issue":"2","key":"2599_CR41","first-page":"317","volume":"16","author":"YJ Ren","year":"2015","unstructured":"Ren YJ, Shen J, Wang J et al (2015) Mutual verifiable provable data auditing in public cloud storage. J Internet Technol 16(2):317\u2013323","journal-title":"J Internet Technol"},{"issue":"4","key":"2599_CR42","first-page":"902","volume":"98","author":"MA Tinghuai","year":"2015","unstructured":"Tinghuai MA, Jinjuan Z, Meili T et al (2015) Social network and tag sources based augmenting collaborative recommender system. IEICE Trans Inf Syst 98(4):902\u2013910","journal-title":"IEICE Trans Inf Syst"},{"key":"2599_CR43","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"X Wen","year":"2015","unstructured":"Wen X, Shao L, Xue Y et al (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295:395\u2013406","journal-title":"Inf Sci"},{"issue":"1","key":"2599_CR44","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s10851-014-0511-6","volume":"51","author":"B Chen","year":"2015","unstructured":"Chen B, Shu H, Coatrieux G et al (2015) Color image analysis by quaternion-type moments. J Math Imaging Vis 51(1):124\u2013144","journal-title":"J Math Imaging Vis"},{"issue":"8","key":"2599_CR45","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1002\/sec.864","volume":"7","author":"Z Xia","year":"2014","unstructured":"Xia Z, Wang X, Sun X et al (2014) Steganalysis of least significant bit matching using multi-order differences. Secur Commun Networks 7(8):1283\u20131291","journal-title":"Secur Commun Networks"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2599-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T19:43:33Z","timestamp":1657309413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2599-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,19]]},"references-count":45,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2599"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2599-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2016,9,19]]}}}