{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:50:04Z","timestamp":1720641004472},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1016\/j.endm.2016.03.038","type":"journal-article","created":{"date-parts":[[2016,5,22]],"date-time":"2016-05-22T01:15:20Z","timestamp":1463879720000},"page":"285-292","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm"],"prefix":"10.1016","volume":"52","author":[{"given":"Abilio","family":"Lucena","sequence":"first","affiliation":[]},{"given":"Luidi","family":"Simonetti","sequence":"additional","affiliation":[]},{"given":"Alexandre Salles","family":"da Cunha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2016.03.038_br0010","doi-asserted-by":"crossref","unstructured":"J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, 7:48\u201350, 1956.","DOI":"10.2307\/2033241"},{"issue":"3","key":"10.1016\/j.endm.2016.03.038_br0020","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.10114","article-title":"The ring star problem: Polyhedral analysis and exact algorithm","volume":"43","author":"Labb\u00e9","year":"2004","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.endm.2016.03.038_br0030","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10287-009-0116-5","article-title":"Reformulations and solution algorithms for the maximum leaf spanning tree problem","volume":"7","author":"Lucena","year":"2010","journal-title":"Computational Management Science"},{"key":"10.1016\/j.endm.2016.03.038_br0040","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","article-title":"Strong lower bounds for the prize-collecting Steiner problem in Graphs","volume":"141","author":"Lucena","year":"2004","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"10.1016\/j.endm.2016.03.038_br0050","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/j.endm.2016.03.038_br0060","first-page":"376384","article-title":"A traveling salesman problem library","volume":"3","author":"Rinelt","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/j.endm.2016.03.038_br0070","series-title":"Network Optimization","first-page":"162","article-title":"The minimum connected dominating set problem: Formulation, valid inequalities and branch-and-cut algorithm","volume":"vol. 6701","author":"Simonetti","year":"2011"},{"key":"10.1016\/j.endm.2016.03.038_br0080","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1016\/j.dam.2011.01.015","article-title":"The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm","volume":"159","author":"Simonetti","year":"2011","journal-title":"Discrete Applied Mathematics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065316300439?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065316300439?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T09:42:20Z","timestamp":1567935740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065316300439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":8,"alternative-id":["S1571065316300439"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2016.03.038","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2016,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2016.03.038","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}