{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:50:31Z","timestamp":1720641031157},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1016\/j.endm.2011.05.054","type":"journal-article","created":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T21:54:06Z","timestamp":1312235646000},"page":"315-320","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem"],"prefix":"10.1016","volume":"37","author":[{"given":"Dilson Lucas","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Salles da Cunha","sequence":"additional","affiliation":[]},{"given":"Geraldo Robson","family":"Mateus","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2011.05.054_br0010","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","article-title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","volume":"34","author":"Boland","year":"2006","journal-title":"Operation Research Letters"},{"key":"10.1016\/j.endm.2011.05.054_br0020","unstructured":"C. Bechelane, Uma abordagem para minimiza\u00e7\u00e3o de consumo de energia em redes de sensores sem fio com sorvedouros m\u00f3veis, Master\u02bcs thesis, Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, Brasil (2009), in Portuguese."},{"key":"10.1016\/j.endm.2011.05.054_br0030","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.endm.2009.11.024","article-title":"The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks","volume":"35","author":"Bechelane","year":"2009","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.endm.2011.05.054_br0040","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","article-title":"A branch-and-cut algorithm for the undirected selective traveling salesman problem","volume":"32","author":"Gendreau","year":"1998","journal-title":"Networks"},{"key":"10.1016\/j.endm.2011.05.054_br0050","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","article-title":"Multicommodity flow models for spanning trees with hop constraints","volume":"95","author":"Gouveia","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.endm.2011.05.054_br0060","doi-asserted-by":"crossref","unstructured":"D.L. Pereira, W. M. Jr., A. S. Cunha, A proposal of parallelization of local search procedures applied to the minimum cost hop-and-root constrained forest problem, XI Simp\u00f3sio em Sistemas Computacionais, Petr\u00f3polis-RJ, Brazil, 2010.","DOI":"10.1109\/WSCAD-SCC.2010.14"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065311000552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065311000552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T13:11:44Z","timestamp":1560431504000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065311000552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":6,"alternative-id":["S1571065311000552"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2011.05.054","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}