{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T11:38:30Z","timestamp":1772192310886,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T00:00:00Z","timestamp":1483056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503074"],"award-info":[{"award-number":["61503074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00521-016-2800-z","type":"journal-article","created":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T03:37:49Z","timestamp":1483069069000},"page":"2245-2256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An efficient local search for partial vertex cover problem"],"prefix":"10.1007","volume":"30","author":[{"given":"Yupeng","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Na","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Jianan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,30]]},"reference":[{"key":"2800_CR1","first-page":"85","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Plenum Press, New York, pp 85\u2013103"},{"issue":"3","key":"2800_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233\u2013235","journal-title":"Math Oper Res"},{"issue":"2","key":"2800_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","volume":"23","author":"RB Allan","year":"1978","unstructured":"Allan RB, Laskar R (1978) On domination and independent domination numbers of a graph. Discrete Math 23(2):73\u201376","journal-title":"Discrete Math"},{"issue":"2","key":"2800_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1057\/jors.1984.16","volume":"35","author":"HD Sherali","year":"1984","unstructured":"Sherali HD, Rios M (1984) An air force crew allocation and scheduling problem. J Oper Res Soc 35(2):91\u2013103","journal-title":"J Oper Res Soc"},{"issue":"6","key":"2800_CR5","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.46.6.820","volume":"46","author":"A Caprara","year":"1998","unstructured":"Caprara A, Toth P, Vigo D, Fischetti M (1998) Modeling and solving the crew rostering problem. Oper Res 46(6):820\u2013830","journal-title":"Oper Res"},{"issue":"1","key":"2800_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0165-0114(93)90519-N","volume":"53","author":"LR Woodyatt","year":"1993","unstructured":"Woodyatt LR, Stott KL, Wolf FE, Vasko FJ (1993) An application combining set covering and fuzzy sets to optimally assign metallurgical grades to customer orders. Fuzzy Sets Syst 53(1):15\u201325","journal-title":"Fuzzy Sets Syst"},{"key":"2800_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res 25:159\u2013185","journal-title":"J Artif Intell Res"},{"key":"2800_CR8","unstructured":"Khuri S, B\u00e4ck T (1994) An evolutionary heuristic for the minimum vertex cover problem. In: Genetic algorithms within the framework of evolutionary computation\u2014proceedings of the KI-94 workshop, pp 86\u201390"},{"issue":"2","key":"2800_CR9","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"CC Aggarwal","year":"1997","unstructured":"Aggarwal CC, Orlin JB, Tai RP (1997) Optimized crossover for the independent set problem. Oper Res 45(2):226\u2013234","journal-title":"Oper Res"},{"issue":"4","key":"2800_CR10","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade DV, Resende MG, Werneck RF (2012) Fast local search for the maximum independent set problem. J Heuristics 18(4):525\u2013547","journal-title":"J Heuristics"},{"issue":"4","key":"2800_CR11","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10878-004-4835-9","volume":"8","author":"VC Barbosa","year":"2004","unstructured":"Barbosa VC, Campos LC (2004) A novel evolutionary formulation of the maximum independent set problem. J Comb Optim 8(4):419\u2013437","journal-title":"J Comb Optim"},{"key":"2800_CR12","volume-title":"The computational complexity of machine learning","author":"MJ Kearns","year":"1990","unstructured":"Kearns MJ (1990) The computational complexity of machine learning. MIT Press, Cambridge"},{"key":"2800_CR13","unstructured":"Charikar M, Khuller S, Mount DM, Narasimhan G (2001) Algorithms for facility location problems with outliers. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms, pp 642\u2013651"},{"issue":"6","key":"2800_CR14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0020-0190(02)00434-9","volume":"85","author":"M Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser M (2003) Computing small partial coverings. Inf Process Lett 85(6):327\u2013331","journal-title":"Inf Process Lett"},{"issue":"2","key":"2800_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda R (2001) Using homogeneous weights for approximating the partial cover problem. J Algorithms 39(2):137\u2013144","journal-title":"J Algorithms"},{"issue":"1","key":"2800_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/1077464.1077468","volume":"1","author":"ED Demaine","year":"2005","unstructured":"Demaine ED, Fomin FV, Hajiaghayi M, Thilikos DM (2005) Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans Algorithms (TALG) 1(1):33\u201347","journal-title":"ACM Trans Algorithms (TALG)"},{"issue":"6","key":"2800_CR17","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine ED, Fomin FV, Hajiaghayi M, Thilikos DM (2005) Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J ACM (JACM) 52(6):866\u2013893","journal-title":"J ACM (JACM)"},{"issue":"1","key":"2800_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi R, Khuller S, Srinivasan A (2004) Approximation algorithms for partial covering problems. J Algorithms 53(1):55\u201384","journal-title":"J Algorithms"},{"key":"2800_CR19","unstructured":"Bshouty NH, Burroughs L (1998) Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In: STACS 98, pp 298\u2013308"},{"key":"2800_CR20","doi-asserted-by":"crossref","unstructured":"Hochbaum DS (1998) The t-vertex cover problem: extending the half integrality framework with budget constraints. In: Approximation algorithms for combinatorial optimization, pp 111\u2013122","DOI":"10.1007\/BFb0053968"},{"issue":"2","key":"2800_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda R (2001) Using homogeneous weights for approximating the partial cover problem. J Algorithms 39(2):137\u2013144","journal-title":"J Algorithms"},{"key":"2800_CR22","doi-asserted-by":"crossref","unstructured":"Halperin E, Srinivasan A (2002) Improved approximation algorithms for the partial vertex cover problem. In: Approximation algorithms for combinatorial optimization, pp 161\u2013174","DOI":"10.1007\/3-540-45753-4_15"},{"issue":"7\u20138","key":"2800_CR23","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\u20134","key":"2800_CR24","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":"2800_CR25","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":"25","key":"2800_CR26","first-page":"5961","volume":"6","author":"X Li","year":"2011","unstructured":"Li X, Yin M, Ma Z (2011) Hybrid differential evolution and gravitation search algorithm for unconstrained optimization. Int J Phys Sci 6(25):5961\u20135981","journal-title":"Int J Phys Sci"},{"issue":"2","key":"2800_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MG (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67\u201371","journal-title":"Oper Res Lett"},{"issue":"2","key":"2800_CR28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109\u2013133","journal-title":"J Glob Optim"},{"issue":"8","key":"2800_CR29","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K Xu","year":"2007","unstructured":"Xu K, Boussemart F, Hemery F, Lecoutre C (2007) Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artif Intell 171(8):514\u2013534","journal-title":"Artif Intell"},{"key":"2800_CR30","doi-asserted-by":"crossref","unstructured":"Johnson DS, Trick MA (1996) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11\u201313, 1993, vol 26. American Mathematical Soc","DOI":"10.1090\/dimacs\/026"},{"key":"2800_CR31","first-page":"929","volume":"15","author":"P Guo","year":"2014","unstructured":"Guo P, Wang J, Li B, Lee S (2014) A variable threshold-value authentication architecture for wireless mesh networks. J Internet Technol 15:929\u2013936","journal-title":"J Internet Technol"},{"issue":"1","key":"2800_CR32","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1587\/transcom.E98.B.190","volume":"E98-B","author":"F Zhangjie","year":"2015","unstructured":"Zhangjie F, Xingming S, Qi L, Lu Z, Jiangang S (2015) Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans Commun E98-B(1):190\u2013200","journal-title":"IEICE Trans Commun"},{"key":"2800_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2172-9","author":"R Li","year":"2016","unstructured":"Li R, Hu S, Wang Y, Yin M (2016) 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","journal-title":"Neural Comput Appl"},{"key":"2800_CR34","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Yin M (2016) Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the thirtieth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"2800_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5377-8","author":"Y Wang","year":"2015","unstructured":"Wang Y, Ouyang D, Zhang L, Yin M (2015) A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci China Inf Sci. doi: 10.1007\/s11432-015-5377-8","journal-title":"Sci China Inf Sci"},{"key":"2800_CR36","doi-asserted-by":"crossref","unstructured":"Cai S, Lin J, Su K (2015) Two weighting local search for minimum vertex cover. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9357"},{"key":"2800_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6","author":"Y Wang","year":"2016","unstructured":"Wang Y, Li R, Zhou Y, Yin M (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"},{"key":"2800_CR38","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, Wang J (2016) Two local search algorithms for partition vertex cover problem. J Comput Theor Nanosci 13:743\u2013751","journal-title":"J Comput Theor Nanosci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2800-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2800-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2800-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T07:22:02Z","timestamp":1658301722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2800-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,30]]},"references-count":38,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["2800"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2800-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,30]]}}}