{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T08:58:03Z","timestamp":1699001883059},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T00:00:00Z","timestamp":1478908800000},"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":["61370156","61503074"],"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":["61403076","61403077"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"New Century Excellent Talents in University","award":["NCET-13-0724"]},{"name":"Youth Foundation of Northeast Normal University","award":["1309021"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402070"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s12293-016-0216-z","type":"journal-article","created":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T18:56:39Z","timestamp":1478976999000},"page":"165-176","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A hybrid metaheuristic algorithm for generalized vertex cover problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Shuli","family":"Hu","sequence":"first","affiliation":[]},{"given":"Ruizhi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,12]]},"reference":[{"key":"216_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":"216_CR2","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"216_CR3","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 AAAI-16, pp 805\u2013811","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"216_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":"3","key":"216_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00224-007-1309-3","volume":"41","author":"J Guo","year":"2007","unstructured":"Guo J, Niedermeier R, Wernicke S (2007) Parameterized complexity of vertex cover variants. Theory Comput Syst 41(3):501\u2013520","journal-title":"Theory Comput Syst"},{"key":"216_CR6","doi-asserted-by":"publisher","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 Algorithms 2:66\u201378","journal-title":"ACM Trans Algorithms"},{"issue":"7","key":"216_CR7","doi-asserted-by":"publisher","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":"216_CR8","first-page":"1251","volume":"29","author":"M Milanovic","year":"2010","unstructured":"Milanovic M (2010) Solving the generalized vertex cover problem by genetic algorithm. Comput Inform 29:1251\u20131265","journal-title":"Comput Inform"},{"key":"216_CR9","unstructured":"Chandu DP (2014) A parallel genetic algorithm for generalized vertex cover problem. arXiv:1411.7612"},{"key":"216_CR10","doi-asserted-by":"publisher","unstructured":"Li R, Hu S, Wang Y et al (2016) A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem. Neural Comput Appl. doi: 10.1007\/s00521-016-2324-6","DOI":"10.1007\/s00521-016-2324-6"},{"key":"216_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"},{"key":"216_CR12","doi-asserted-by":"publisher","unstructured":"Samma H, Lim CP, Saleh JM et al (2016) A memetic-based fuzzy support vector machine model and its application to license plate recognition. Memet Comput 1\u201317. doi: 10.1007\/s12293-016-0187-0","DOI":"10.1007\/s12293-016-0187-0"},{"issue":"4","key":"216_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s12293-015-0160-3","volume":"7","author":"PK Mohanty","year":"2015","unstructured":"Mohanty PK, Parhi DR (2015) A new hybrid optimization algorithm for multiple mobile robots navigation based on the CS-ANFIS approach. Memet Comput 7(4):255\u2013273","journal-title":"Memet Comput"},{"key":"216_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ins.2014.02.123","volume":"274","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Guo L, Gandomi AH, Hao G-S, Wang H (2014) Chaotic krill herd algorithm. Inf Sci 274:17\u201334","journal-title":"Inf Sci"},{"key":"216_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2324-6","author":"YY Wang","year":"2016","unstructured":"Wang YY, Li RZ, Zhou YP, Yin MH (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":"216_CR16","doi-asserted-by":"publisher","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","DOI":"10.1007\/s11432-015-5377-8"},{"issue":"3\u20134","key":"216_CR17","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00521-012-1304-8","volume":"24","author":"G Wang","year":"2014","unstructured":"Wang G, Guo L, Wang H, Duan H, Liu L, Li J (2014) Incorporating mutation scheme into krill herd algorithm for global numerical optimization. Neural Comput Appl 24(3\u20134):853\u2013871","journal-title":"Neural Comput Appl"},{"key":"216_CR18","doi-asserted-by":"publisher","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","DOI":"10.1111\/itor.12280"},{"key":"216_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.neucom.2013.08.031","volume":"128","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Gandomi AH, Alavi AH (2014) Stud krill herd algorithm. Neurocomputing 128:363\u2013370","journal-title":"Neurocomputing"},{"key":"216_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2429-y","author":"R Li","year":"2016","unstructured":"Li R, Shuli H, Gao J, Zhou Y, Wang Y, Yin M (2016) GRASP for connected dominating set problems. Neural Comput Appl. doi: 10.1007\/s00521-016-2429-y","journal-title":"Neural Comput Appl."},{"issue":"2","key":"216_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s12293-013-0108-4","volume":"5","author":"AC Dan","year":"2013","unstructured":"Dan AC, Bacardit J (2013) Integrating memetic search into the BioHEL evolutionary learning system for large-scale datasets. Memet Comput 5(2):95\u2013130","journal-title":"Memet Comput"},{"key":"216_CR22","doi-asserted-by":"publisher","unstructured":"Nama S, Saha AK, Ghosh S (2016) A hybrid symbiosis organisms search algorithm and its application to real world problems. Memet Comput 1\u201320. doi: 10.1007\/s12293-016-0194-1","DOI":"10.1007\/s12293-016-0194-1"},{"issue":"6","key":"216_CR23","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum C, Puchinger J, Raidl GR et al (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11(6):4135\u20134151","journal-title":"Appl Soft Comput"},{"issue":"1","key":"216_CR24","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11277-014-1748-5","volume":"78","author":"S Xie","year":"2014","unstructured":"Xie S, Wang Y (2014) Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wirel Pers Commun 78(1):231\u2013246","journal-title":"Wirel Pers Commun"},{"issue":"1","key":"216_CR25","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/s10851-014-0511-6","volume":"51","author":"B Chen","year":"2015","unstructured":"Chen B, Shu H, Coatrieux G, Chen G, Sun X, Coatrieux J-L (2015) Color image analysis by quaternion-type moments. J Math Imaging Vis 51(1):124\u2013144","journal-title":"J Math Imaging Vis"},{"issue":"1","key":"216_CR26","doi-asserted-by":"publisher","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, Fang W (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295(1):395\u2013406","journal-title":"Inf Sci"},{"issue":"1","key":"216_CR27","first-page":"190","volume":"E98\u2013B","author":"F Zhangjie","year":"2015","unstructured":"Zhangjie F, Sun X, 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\u2013B(1):190\u2013200","journal-title":"IEICE Trans Commun"},{"key":"216_CR28","doi-asserted-by":"publisher","unstructured":"Gu B, Sheng VS (2016) A robust regularization path algorithm for $$\\nu $$ \u03bd -support vector classification. IEEE Trans Neural Netw Learn Syst. doi: 10.1109\/TNNLS.2016.2527796","DOI":"10.1109\/TNNLS.2016.2527796"},{"issue":"4","key":"216_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s12293-014-0143-9","volume":"6","author":"L Vanneschi","year":"2014","unstructured":"Vanneschi L (2014) Improving genetic programming for the prediction of pharmacokinetic parameters. Memet Comput 6(4):255\u2013262. doi: 10.1007\/s12293-014-0143-9","journal-title":"Memet Comput"},{"issue":"3","key":"216_CR30","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s12293-015-0158-x","volume":"7","author":"SS Jadon","year":"2015","unstructured":"Jadon SS, Bansal JC, Tiwari R et al (2015) Accelerating artificial bee colony algorithm with adaptive local search. Memet Comput 7(3):215\u2013230. doi: 10.1007\/s12293-015-0158-x","journal-title":"Memet Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-016-0216-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0216-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0216-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T22:06:49Z","timestamp":1692569209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-016-0216-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,12]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["216"],"URL":"https:\/\/doi.org\/10.1007\/s12293-016-0216-z","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,12]]},"assertion":[{"value":"1 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}