{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:08:08Z","timestamp":1764238088205},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T00:00:00Z","timestamp":1348012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10732-012-9211-9","type":"journal-article","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T12:25:15Z","timestamp":1347971115000},"page":"869-876","source":"Crossref","is-referenced-by-count":17,"title":["A hybridized tabu search approach for the minimum weight vertex cover problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Stefan","family":"Vo\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Fink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"key":"9211_CR1","first-page":"34","volume":"4","author":"S. Balaji","year":"2010","unstructured":"Balaji, S., Swaminathan, V., Kannan, K.: An effective algorithm for minimum weighted vertex cover problem. Int. J. Comput. Math. Sci. 4, 34\u201338 (2010)","journal-title":"Int. J. Comput. Math. Sci."},{"key":"9211_CR2","first-page":"61","volume-title":"Modern Heuristic Search Methods","author":"R. Battiti","year":"1996","unstructured":"Battiti, R.: Reactive search: toward self-tuning heuristics. In: Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (eds.) Modern Heuristic Search Methods, pp. 61\u201383. Wiley, Chichester (1996)"},{"key":"9211_CR3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA J. Comput. 6, 126\u2013140 (1994)","journal-title":"ORSA J. Comput."},{"key":"9211_CR4","first-page":"1","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: Metaheuristics: intelligent problem solving. In: Maniezzo, V., St\u00fctzle, T., Vo\u00df,\u00a0S. (eds.) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, pp. 1\u201338. Springer, Berlin (2009)"},{"key":"9211_CR5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex-cover. Ann. Math. 162, 439\u2013485 (2005)","journal-title":"Ann. Math."},{"key":"9211_CR6","first-page":"81","volume-title":"Optimization Software Class Libraries","author":"A. Fink","year":"2002","unstructured":"Fink, A., Vo\u00df, S.: HotFrame: a heuristic optimization framework. In: Vo\u00df, S., Woodruff, D.L. (eds.) Optimization Software Class Libraries, pp. 81\u2013154. Kluwer, Boston (2002)"},{"key":"9211_CR7","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/11839088_45","volume":"4150","author":"S. Gilmour","year":"2006","unstructured":"Gilmour, S., Dras, M.: Kernelization as heuristic structure for the vertex cover problem. Lect. Notes Comput. Sci. 4150, 452\u2013459 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9211_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)"},{"key":"9211_CR9","doi-asserted-by":"crossref","first-page":"3520","DOI":"10.1016\/j.cor.2005.03.030","volume":"33","author":"F.C. Gomes","year":"2006","unstructured":"Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Comput. Oper. Res. 33, 3520\u20133534 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9211_CR10","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper. Res. 37, 865\u2013892 (1989)","journal-title":"Oper. Res."},{"key":"9211_CR11","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.: An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl. Soft Comput. 11, 5360\u20135366 (2011)","journal-title":"Appl. Soft Comput."},{"key":"9211_CR12","first-page":"83","volume":"9","author":"R. Jovanovic","year":"2010","unstructured":"Jovanovic, R., Tuba, M., Simian, D.: Comparison of different topologies for island-based multi-colony ant algorithms for the minimum weight vertex cover problem. WSEAS Trans. Comput. 9, 83\u201392 (2010)","journal-title":"WSEAS Trans. Comput."},{"key":"9211_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9211_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-\u03f5. J. Comput. Syst. Sci. 74, 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"9211_CR15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. Jr., Vecchi, M.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"9211_CR16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"S.J. Shyu","year":"2004","unstructured":"Shyu, S.J., Yin, P.-Y., Lin, B.M.T.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann. Oper. Res. 131, 283\u2013304 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9211_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1142\/S0217595906000905","volume":"23","author":"A. Singh","year":"2006","unstructured":"Singh, A., Gupta, A.K.: A hybrid heuristic for the minimum weight vertex cover problem. Asia-Pac. J. Oper. Res. 23, 273\u2013285 (2006)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9211_CR18","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/978-3-642-34413-8_53","volume":"7219","author":"S. Vo\u00df","year":"2012","unstructured":"Vo\u00df, S., Fink, A.: Hybridizing reactive tabu search with simulated annealing. Lect. Notes Comput. Sci. 7219, 509\u2013512 (2012)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9211_CR19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S. Vo\u00df","year":"2005","unstructured":"Vo\u00df, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136, 285\u2013302 (2005)","journal-title":"Ann. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9211-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9211-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9211-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:33Z","timestamp":1559242473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9211-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9211"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9211-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,19]]}}}