{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:09:13Z","timestamp":1768684153581,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,2,14]],"date-time":"2015-02-14T00:00:00Z","timestamp":1423872000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11590-015-0851-1","type":"journal-article","created":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T07:55:19Z","timestamp":1423814119000},"page":"1331-1339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Exact solutions to generalized vertex covering problems: a comparison of two models"],"prefix":"10.1007","volume":"9","author":[{"given":"Gary","family":"Kochenberger","sequence":"first","affiliation":[]},{"given":"Mark","family":"Lewis","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"851_CR1","first-page":"9","volume":"1","author":"B Alidaee","year":"2009","unstructured":"Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H.: Computationally attractive non-linear models for combinatorial optimization. Int. J. Math. OR. 1, 9\u201319 (2009)","journal-title":"Int. J. Math. OR."},{"key":"851_CR2","first-page":"632","volume":"121","author":"S Bouamama","year":"2012","unstructured":"Bouamama, S., Blum, C., Boukerram, A.: Population-based iterated Greedy algorithm for the minimum weight vertex cover problem. A Appl. Soft Comput. 121, 632\u20131639 (2012)","journal-title":"A Appl. Soft Comput."},{"key":"851_CR3","doi-asserted-by":"crossref","unstructured":"Cai, S., K. Su, Chen, Q.: EWLS: a new local search for minimum vertex cover. In: Proceedings of the 24 $$^{th}$$ t h AAAI Conference on Artificial Intelligence. pp. 45\u201350 (2010)","DOI":"10.1609\/aaai.v24i1.7539"},{"key":"851_CR4","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K., Sattar, A.: Two new local search strategies for minimum vertex cover. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence. pp. 441\u2013447 (2012)","DOI":"10.1609\/aaai.v26i1.8125"},{"key":"851_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.ipl.2013.01.001","volume":"113","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M.: Split vertex deletion meets vertex cover: new fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113, 179\u2013182 (2013)","journal-title":"Inf. Process. Lett."},{"key":"851_CR6","doi-asserted-by":"crossref","first-page":"3520","DOI":"10.1016\/j.cor.2005.03.030","volume":"33","author":"FC 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":"851_CR7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/1125994.1125998","volume":"2","author":"R Hassin","year":"2006","unstructured":"Hassin, R., Levin, A.: The minimum generalized vertex cover problem. ACM Trans. Algorithms 2, 66\u201378 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"851_CR8","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s11590-012-0458-8","volume":"7","author":"Y Hsia","year":"2013","unstructured":"Hsia, Y., Wang, Y.: A new penalty parameter for linearly constrained 0\u20131 quadratic programming problems. Optim. Lett. 7, 765\u2013778 (2013)","journal-title":"Optim. Lett."},{"key":"851_CR9","doi-asserted-by":"crossref","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Javoanovic","year":"2011","unstructured":"Javoanovic, 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."},{"issue":"1","key":"851_CR10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1002\/net.20255","volume":"53","author":"M Lewis","year":"2008","unstructured":"Lewis, M.: On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem. Networks 53(1), 6\u201318 (2008)","journal-title":"Networks"},{"issue":"4","key":"851_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(94)00189-6","volume":"53","author":"A Likas","year":"1995","unstructured":"Likas, A., Stafylopatis, A.: A parallel algorithm for the minimum weighted vertex cover problem. Inf. Process. Lett. 53(4), 229\u2013234 (1995)","journal-title":"Inf. Process. Lett."},{"key":"851_CR12","first-page":"1251","volume":"29","author":"M Milanovic","year":"2010","unstructured":"Milanovic, M.: Solving the generalized vertex cover problem by genetic algorithm. Comput. Inf. 29, 1251\u20131265 (2010)","journal-title":"Comput. Inf."},{"key":"851_CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"S Shyu","year":"2004","unstructured":"Shyu, S., Yin, P.-Y., Lin, B.M.T.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann. OR. 131, 283\u2013304 (2004)","journal-title":"Ann. OR."},{"key":"851_CR14","first-page":"869","volume":"18","author":"S Voss","year":"2012","unstructured":"Voss, S., Fink, A.: A hybridized tabu search approach for the minimum weight vertex cover problem. JOH 18, 869\u2013876 (2012)","journal-title":"JOH"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0851-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0851-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0851-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T16:06:21Z","timestamp":1691251581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0851-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,14]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0851-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,14]]}}}