{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:06Z","timestamp":1759666146088},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"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":[[2016,10]]},"DOI":"10.1007\/s11590-015-0952-x","type":"journal-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T13:50:56Z","timestamp":1446558656000},"page":"1493-1504","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Searching for a cycle with maximum coverage in undirected graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Andrea","family":"Grosso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Salassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Vancroonenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"952_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0167-6377(85)90044-6","volume":"4","author":"CJ Colbourn","year":"1985","unstructured":"Colbourn, C.J., Keil, J.M., Stewart, L.K.: Finding minimum dominating cycles in permutation graphs. Oper. Res. Lett. 4, 13\u201317 (1985)","journal-title":"Oper. Res. Lett."},{"key":"952_CR2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"Current, J.R., Schilling, D.A.: The Covering Salesman Problem. Transp. Sci. 23, 208\u2013213 (1989)","journal-title":"Transp. Sci."},{"key":"952_CR3","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Prog. 98, 23\u201347 (2003)","DOI":"10.1007\/s10107-003-0395-5"},{"key":"952_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than $$2^n$$ 2 n . Algorithmica 52, 153\u2013166 (2008)","journal-title":"Algorithmica"},{"key":"952_CR5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau, M., Laporte, G., Semet, F.: The covering tour problem. Oper. Res. 45, 568\u2013576 (1997)","journal-title":"Oper. Res."},{"issue":"4","key":"952_CR6","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"B Golden","year":"2012","unstructured":"Golden, B., Zahra, N.-A., Raghavan, S., Salari, M., Toth, P.: The generalized Covering Salesman Problem. INFORMS J. Comput. 24(4), 534\u2013553 (2012)","journal-title":"INFORMS J. Comput."},{"key":"952_CR7","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"952_CR8","unstructured":"Hamiltonian Cycle problem. NP Datalog. http:\/\/wwwinfo.deis.unical.it\/npdatalog\/experiments\/hamiltoniancycle.htm . Accessed 8 April 2013"},{"issue":"1","key":"952_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-009-0546-z","volume":"183","author":"S Hanafi","year":"2011","unstructured":"Hanafi, S., Wilbaut, C.: Improved convergent heuristics for the 0\u20131 multidimensional knapsack problem. Ann. OR 183(1), 125\u2013142 (2011)","journal-title":"Ann. OR"},{"key":"952_CR10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4153\/CMB-1977-034-8","volume":"20","author":"L Lesniak-Foster","year":"1977","unstructured":"Lesniak-Foster, L., Williamson, J.E.: On spanning and dominating circuits in graphs. Can. Bull. Math. 20, 215\u2013220 (1977)","journal-title":"Can. Bull. Math."},{"key":"952_CR11","unstructured":"OR Library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"952_CR12","unstructured":"Pferschy, U., Stan\u0115k, R.: Generating subtour constraints for the TSP from pure integer solutions. Optimization Online. http:\/\/www.optimization-online.org\/DB_HTML\/2014\/02\/4258.html"},{"key":"952_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(83)90165-6","volume":"43","author":"HJ Veldman","year":"1983","unstructured":"Veldman, H.J.: Existence of dominating cycles and paths. Discret. Math. 43, 281\u2013296 (1983)","journal-title":"Discret. Math."},{"key":"952_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(92)00063-W","volume":"124","author":"HJ Veldman","year":"1994","unstructured":"Veldman, H.J.: On dominating and spanning circuits in graphs. Discret. Math. 124, 229\u2013239 (1994)","journal-title":"Discret. Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0952-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0952-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0952-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0952-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["952"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0952-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,3]]}}}