{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T15:20:31Z","timestamp":1780327231018,"version":"3.54.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T00:00:00Z","timestamp":1432857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-015-9909-3","type":"journal-article","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T08:54:57Z","timestamp":1432803297000},"page":"368-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Multi-start iterated tabu search for the minimum weight vertex cover problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Taoqing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junwen","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"issue":"3","key":"9909_CR1","first-page":"130","volume":"1","author":"SR Balachandar","year":"2009","unstructured":"Balachandar SR, Kannan K (2009) A meta-heuristic algorithm for vertex covering problem based on gravity. Int J Math Stat Sci 1(3):130\u2013136","journal-title":"Int J Math Stat Sci"},{"issue":"6","key":"9909_CR2","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. Appl Soft Comput 12(6):1632\u20131639","journal-title":"Appl Soft Comput"},{"key":"9909_CR3","first-page":"238","volume":"2006","author":"J Chen","year":"2006","unstructured":"Chen J, Kanj IA, Xia G (2006) Improved parameterized upper bounds for vertex cover. Math Found Comput Sci 2006:238\u2013249","journal-title":"Math Found Comput Sci"},{"issue":"3","key":"9909_CR4","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"},{"key":"9909_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-014-9752-y","volume":"28","author":"M Ouali El","year":"2014","unstructured":"El Ouali M, Fohlin H, Srivastav A (2014) An approximation algorithm for the partial vertex cover problem in hypergraphs. J Comb Optim 28:1\u201319","journal-title":"J Comb Optim"},{"issue":"2","key":"9909_CR6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.ejor.2012.10.022","volume":"225","author":"Z Fu","year":"2013","unstructured":"Fu Z, Huang W, L\u00fc Z (2013) Iterated tabu search for the circular open dimension problem. Eur J Oper Res 225(2):236\u2013243","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9909_CR7","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":"9","key":"9909_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-011-4424-3","volume":"56","author":"W Huang","year":"2013","unstructured":"Huang W, Fu Z, Xu R (2013) Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container. Sci China Info Sci 56(9):1\u201314","journal-title":"Sci China Info Sci"},{"issue":"8","key":"9909_CR9","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 11(8):5360\u20135366","journal-title":"Appl Soft Comput"},{"key":"9909_CR10","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM, Miller RE, Theater JW (1972) Complexity of computer computations. Plenum Press, New York"},{"issue":"1","key":"9909_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc Z, Hao JK (2010) Adaptive tabu search for course timetabling. Eur J Oper Res 200(1):235\u2013244","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9909_CR12","doi-asserted-by":"crossref","first-page":"026130","DOI":"10.1103\/PhysRevE.80.026130","volume":"80","author":"Z L\u00fc","year":"2009","unstructured":"L\u00fc Z, Huang W (2009) Iterated tabu search for identifying community structure in complex networks. Phys Rev E 80(2):026130","journal-title":"Phys Rev E"},{"issue":"1","key":"9909_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M Malek","year":"1989","unstructured":"Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann Oper Res 21(1):59\u201384","journal-title":"Ann Oper Res"},{"issue":"2","key":"9909_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier R, Rossmanith P (2003) On efficient fixed-parameter algorithms for weighted vertex cover. J Algorithms 47(2):63\u201377","journal-title":"J Algorithms"},{"key":"9909_CR15","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng T (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Computers Oper Res 53:154\u2013164","journal-title":"Computers Oper Res"},{"issue":"1\u20134","key":"9909_CR16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"SJ Shyu","year":"2004","unstructured":"Shyu SJ, Yin PY, Lin BM (2004) An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann Oper Res 131(1\u20134):283\u2013304","journal-title":"Ann Oper Res"},{"issue":"02","key":"9909_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1142\/S0217595906000905","volume":"23","author":"A Singh","year":"2006","unstructured":"Singh A, Gupta AK (2006) A hybrid heuristic for the minimum weight vertex cover problem. Asia Pac J Oper Res 23(02):273\u2013285","journal-title":"Asia Pac J Oper Res"},{"issue":"6","key":"9909_CR18","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1007\/s10732-012-9211-9","volume":"18","author":"S Vo\u00df","year":"2012","unstructured":"Vo\u00df S, Fink A (2012) A hybridized tabu search approach for the minimum weight vertex cover problem. J Heuristics 18(6):869\u2013876","journal-title":"J Heuristics"},{"issue":"3","key":"9909_CR19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10898-011-9726-x","volume":"53","author":"W Zhang","year":"2012","unstructured":"Zhang W, Wu W, Lee W, Du DZ (2012) Complexity and approximation of the connected set-cover problem. J Glob Optim 53(3):563\u2013572","journal-title":"J Glob Optim"},{"key":"9909_CR20","first-page":"1","volume":"59","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Wu W, Fan L, Du DZ (2013) Minimum vertex cover in ball graphs through local search. J Glob Optim 59:1\u20139","journal-title":"J Glob Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9909-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9909-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9909-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:27Z","timestamp":1559276607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9909-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,29]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9909"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9909-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,29]]}}}