{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T08:25:34Z","timestamp":1715934334334},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,1,9]],"date-time":"2016-01-09T00:00:00Z","timestamp":1452297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"publisher","award":["NCET-13-0724"],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370156","61403076","61403077"],"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":[[2017,7]]},"DOI":"10.1007\/s00521-015-2172-9","type":"journal-article","created":{"date-parts":[[2016,1,9]],"date-time":"2016-01-09T05:49:26Z","timestamp":1452318566000},"page":"1775-1785","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"2172_CR1","doi-asserted-by":"crossref","unstructured":"Richter S, Helmert M, Gretton C (2007) A stochastic local search approach to vertex cover. In: Proceedings of KI-07, pp 412\u2013426","DOI":"10.1007\/978-3-540-74565-5_31"},{"key":"2172_CR2","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 (JAIR) 25:159\u2013185","journal-title":"J Artif Intell Res (JAIR)"},{"key":"2172_CR3","unstructured":"Evans I (1998) An evolutionary heuristic for the minimum vertex cover problem. In: Proceedings of EP-98, pp 377\u2013386"},{"key":"2172_CR4","doi-asserted-by":"crossref","unstructured":"Cai S, Su K, Chen Q (2010) EWLS: a new local search for minimum vertex cover. In: Proceedings of AAAI-10, pp 45\u201350","DOI":"10.1609\/aaai.v24i1.7539"},{"issue":"9\u201310","key":"2172_CR5","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai S, Kaile S, Sattar A (2011) Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif Intell 175(9\u201310):1672\u20131696","journal-title":"Artif Intell"},{"key":"2172_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai S, Kaile S, Luo C, Sattar A (2013) NuMVC: an efficient local search algorithm for minimum vertex cover. J Artif Intell Res (JAIR) 46:687\u2013716","journal-title":"J Artif Intell Res (JAIR)"},{"key":"2172_CR7","doi-asserted-by":"crossref","unstructured":"Cai S, Lin J, Su K (2015) Two weighting local search for minimum vertex cover. In: Proceedings of AAAI-15, pp 1107\u20131113","DOI":"10.1609\/aaai.v29i1.9357"},{"key":"2172_CR8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"C Aggarwal","year":"1997","unstructured":"Aggarwal C, Orlin J, Tai R (1997) Optimized crossover for the independent set problem. Oper Res 45:226\u2013234","journal-title":"Oper Res"},{"key":"2172_CR9","doi-asserted-by":"crossref","unstructured":"Andrade DV, Resende MGC, Werneck RFF (2008) Fast local search for the maximum independent set problem. In: Proceedings of WEA-08, pp 220\u2013234","DOI":"10.1007\/978-3-540-68552-4_17"},{"issue":"4","key":"2172_CR10","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 LCD (2004) A novel evolutionary formulation of the maximum independent set problem. J Comb Optim 8(4):419\u2013437","journal-title":"J Comb Optim"},{"key":"2172_CR11","volume-title":"Complexity of computer computations","author":"R Karp","year":"1972","unstructured":"Karp R, Miller RE, Theater JW (1972) Complexity of computer computations. Plenum Press, New York"},{"key":"2172_CR12","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":"8","key":"2172_CR13","doi-asserted-by":"crossref","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput J 11(8):5360\u20135366","journal-title":"Appl Soft Comput J"},{"issue":"6","key":"2172_CR14","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1016\/j.asoc.2012.02.013","volume":"12","author":"S Bouamama","year":"2012","unstructured":"Bouamama S, Blum C, Boukerram A (2012) A population-based iterated greedy algorithm for the minimum weight vertex cover problem[J]. Appl Soft Comput 12(6):1632\u20131639","journal-title":"Appl Soft Comput"},{"key":"2172_CR15","doi-asserted-by":"publisher","unstructured":"Zhou T, L\u00fc Z, Wang Y, et al (2015) Multi-start iterated tabu search for the minimum weight vertex cover problem. J Comb Optim 1\u201317. doi: 10.1007\/s10878-015-9909-3","DOI":"10.1007\/s10878-015-9909-3"},{"key":"2172_CR16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/1125994.1125998","volume":"2","author":"R Hassin","year":"2006","unstructured":"Hassin R, Levin A (2006) The minimum generalized vertex cover problem. ACM Trans Algorithm 2:66\u201378","journal-title":"ACM Trans Algorithm"},{"key":"2172_CR17","first-page":"869","volume":"18","author":"S Voss","year":"2012","unstructured":"Voss S, Fink A (2012) A hybridized tabu search approach for the minimum weight vertex cover problem. JOH 18:869\u2013876","journal-title":"JOH"},{"key":"2172_CR18","unstructured":"Chandu DP (2014) A parallel genetic algorithm for generalized vertex cover problem. arXiv:1411.7612"},{"issue":"7","key":"2172_CR19","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1007\/s11590-015-0851-1","volume":"9","author":"G Kochenberger","year":"2015","unstructured":"Kochenberger G, Lewis M, Glover F, et al. (2015) Exact solutions to generalized vertex covering problems: a comparison of two models. Optim Lett 9(7):1331\u20131339","journal-title":"Optim Lett"},{"key":"2172_CR20","first-page":"1251","volume":"29","author":"M Milanovic","year":"2010","unstructured":"Milanovic M (2010) Solving the generalized vertex cover problem by genetic algorithm. Comput Inf 29:1251\u20131265","journal-title":"Comput Inf"},{"issue":"3","key":"2172_CR21","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\u2014Part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"2172_CR22","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"},{"issue":"4","key":"2172_CR23","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R Battiti","year":"2001","unstructured":"Battiti R, Protasi M (2001) Reactive local search for the maximum clique problem. Algorithmica 29(4):610\u2013637","journal-title":"Algorithmica"},{"key":"2172_CR24","unstructured":"Mazure B, Sais L, Gr\u00e9goire \u00c9 (1997) Tabu search for sat. In: Proceedings of AAAI-97, pp 281\u2013285"},{"key":"2172_CR25","doi-asserted-by":"crossref","unstructured":"Smyth K, Hoos HH, St\u00fctzle T (2003) Iterated robust tabu search for max-SAT. In: Canadian conference on AI, pp 129\u2013144","DOI":"10.1007\/3-540-44886-1_12"},{"issue":"3\u20134","key":"2172_CR26","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":"2172_CR27","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s00521-013-1354-6","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, 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":"2172_CR28","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"},{"key":"2172_CR29","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. SCIENCE CHINA Info Sci. doi: 10.1007\/s11432-015-5377-8","journal-title":"SCIENCE CHINA Info Sci"},{"key":"2172_CR30","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ins.2014.11.042","volume":"298","author":"X Li","year":"2015","unstructured":"Li X, Yin M (2015) Modified cuckoo search algorithm with self adaptive parameter method. Info Sci 298:80\u201397","journal-title":"Info Sci"},{"issue":"4","key":"2172_CR31","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TNB.2013.2294716","volume":"12","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) Multiobjective binary biogeography based optimization for feature selection using gene expression data. IEEE Trans NanoBiosci 12(4):343\u2013353","journal-title":"IEEE Trans NanoBiosci"},{"issue":"7","key":"2172_CR32","first-page":"072109(9)","volume":"57","author":"P Huang","year":"2014","unstructured":"Huang P, Yin M (2014) An upper (lower) bound for Max (Min) CSP. SCIENCE CHINA Info Sci 57(7):072109(9)","journal-title":"SCIENCE CHINA Info Sci"},{"key":"2172_CR33","unstructured":"Gent IP, Walsh T (1993) Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI-93, pp 28\u201333"},{"key":"2172_CR34","unstructured":"McAllester D, Selman B, Kautz H (1997) Evidence for invariants in local search. In: Proceedings of AAAI-97, pp 321\u2013326"},{"key":"2172_CR35","doi-asserted-by":"crossref","unstructured":"Li C, Huang W (2005) Diversification and determinism in local search for satisfiability. In: Proceedings of SAT-05, pp 158\u2013172","DOI":"10.1007\/11499107_12"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-015-2172-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2172-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2172-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2172-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T12:26:08Z","timestamp":1692188768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-015-2172-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,9]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["2172"],"URL":"https:\/\/doi.org\/10.1007\/s00521-015-2172-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,9]]}}}