{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:14:14Z","timestamp":1740147254363,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T00:00:00Z","timestamp":1436486400000},"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":["TOP"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s11750-015-0388-6","type":"journal-article","created":{"date-parts":[[2015,7,9]],"date-time":"2015-07-09T12:04:10Z","timestamp":1436443450000},"page":"360-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Models for a Steiner multi-ring network design problem with revenues"],"prefix":"10.1007","volume":"24","author":[{"given":"Ana","family":"Bautzer","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Gouveia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1339-1974","authenticated-orcid":false,"given":"Ana","family":"Paias","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Manuel","family":"Pires","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,10]]},"reference":[{"key":"388_CR1","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ejor.2009.07.026","volume":"203","author":"R Baldacci","year":"2010","unstructured":"Baldacci R, Dell\u2019Amico M (2010) Heuristic algorithms for the multi-depot ring-star problem. Eur J Oper Res 203:270\u2013281","journal-title":"Eur J Oper Res"},{"key":"388_CR2","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci R, Dell\u2019Amico M, Salazar Gonz\u00e1lez J (2007) The capacitated M-ring-star problem. Ope Res 55:1147\u20131162","journal-title":"Ope Res"},{"key":"388_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.endm.2011.05.047","volume":"37","author":"H Berinsky","year":"2011","unstructured":"Berinsky H, Zabala P (2011) An integer linear programming formulation and branch-and-cut algorithm for the capacitated M-ring-star problem. Electr Notes Discret Math 37:273\u2013278","journal-title":"Electr Notes Discret Math"},{"issue":"2","key":"388_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.21495","volume":"61","author":"P Carroll","year":"2013","unstructured":"Carroll P, Fortz B, Labb\u00e9 M, McGarraghy S (2013) A branch-and-cut algorithm for the ring spur assignment problem. Networks 61(2):89\u2013103","journal-title":"Networks"},{"key":"388_CR5","doi-asserted-by":"crossref","unstructured":"Carroll P, Fortz B, Labb\u00e9 M, McGarraghy S (2011) Improved formulations for the ring spur assignment problem. In: Pahl J, Reiners T, Voss S (eds) Network optimization, vol 6701 of Lecture notes in computer science. Springer, Berlin, pp 24\u201336","DOI":"10.1007\/978-3-642-21527-8_4"},{"key":"388_CR6","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.dam.2007.05.058","volume":"156","author":"M C\u00e2mpelo","year":"2008","unstructured":"C\u00e2mpelo M, Campos VA, Corr\u00eaa RC (2008) On the asymmetric representatives formulations for the vertex coloring problem. Discret Appl Math 156:1097\u20131111. doi: 10.1016\/\/j.dam.2007.05.058","journal-title":"Discret Appl Math"},{"key":"388_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Laporte G (1991) Improvements to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper Res Lett 10:27\u201336","journal-title":"Oper Res Lett"},{"key":"388_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02110085","volume":"4","author":"M Gendreau","year":"1995","unstructured":"Gendreau M, Labb\u00e9 M, Laporte G (1995) Efficient heuristics for the design of ring networks. Telecommun Syst 4:177\u2013188","journal-title":"Telecommun Syst"},{"key":"388_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.20122","volume":"48","author":"L Gouveia","year":"2006","unstructured":"Gouveia L, Pesneau P (2006) On extend formulations for the precedence constrained asymmetric travelling salesman problem. Networks 48:77\u201389","journal-title":"Networks"},{"key":"388_CR10","doi-asserted-by":"crossref","unstructured":"Gouveia L, Pires J (2001a) Models for a Steiner ring network design problem with revenues. Eur J Oper Res 133:21\u201331","DOI":"10.1016\/S0377-2217(00)00144-2"},{"key":"388_CR11","doi-asserted-by":"crossref","unstructured":"Gouveia L, Pires J (2001b) The Asymmetric travelling salesman problem: on generalizations of disaggregated of Miller\u2013Tucker\u2013Zemlin constraints. Discret Appl Math 112:129\u2013145","DOI":"10.1016\/S0166-218X(00)00313-9"},{"key":"388_CR12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(97)00358-5","volume":"112","author":"L Gouveia","year":"1999","unstructured":"Gouveia L, Pires J (1999) The asymmetric travelling salesman problem and a reformulation of the Miller\u2013Tucker\u2013Zemlin constraints. Eur J Oper Res 112:134\u2013146","journal-title":"Eur J Oper Res"},{"key":"388_CR13","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/S0305-0548(98)00005-7","volume":"25","author":"J Klincewicz","year":"1998","unstructured":"Klincewicz J, Luss H, Yan D (1998) Designing tributary networks with multiple ring families. Comput Oper Res 25:1145\u20131157","journal-title":"Comput Oper Res"},{"key":"388_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9 M, Laporte G, Rodr\u00edguez Mart\u00edn I, Salazar Gonz\u00e1lez J (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43:177\u2013189","journal-title":"Networks"},{"key":"388_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.ejor.2011.08.026","volume":"217","author":"Z Naji-Azimi","year":"2012","unstructured":"Naji-Azimi Z, Salari M, Toth P (2012) An integer linear programming based heuristic for the capacitated M-ring-star problem. Eur J Oper Res 217:17\u201325","journal-title":"Eur J Oper Res"},{"key":"388_CR16","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.ejor.2010.06.030","volume":"207","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi Z, Salari M, Toth P (2010) A heuristic procedure for the capacitated M-ring-star problem. Eur J Oper Res 207:1227\u20131234","journal-title":"Eur J Oper Res"},{"key":"388_CR17","unstructured":"Pires JM (2001) Formula\u00e7\u00f5es Para O Problema Do Caixeiro Viajante Assim\u00e9trico E Sua Aplica\u00e7\u00e3o a Um Problema De Desenho De Redes Com Topologia Em Forma De Anel. Faculdade de Ci\u00eancias da Universidade de Lisboa, Departamento de Estat\u00edstica e Investiga\u00e7\u00e3o Operacional"},{"key":"388_CR18","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"SC Sarin","year":"2005","unstructured":"Sarin SC, Sherali HD, Bhootra A (2005) New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper Res Lett 33:62\u201370","journal-title":"Oper Res Lett"},{"key":"388_CR19","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.disopt.2005.10.004","volume":"3","author":"H Sherali","year":"2006","unstructured":"Sherali H, Sarin S, Tsai P (2006) A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discret Optim 3:20\u201332","journal-title":"Discret Optim"},{"key":"388_CR20","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem, vol 9 of SIAM monographs on discrete mathematics and applications, chapter 1. SIAM, Philadelphia, pp 1\u201326"}],"container-title":["TOP"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-015-0388-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11750-015-0388-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-015-0388-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:42:03Z","timestamp":1559562123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11750-015-0388-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["388"],"URL":"https:\/\/doi.org\/10.1007\/s11750-015-0388-6","relation":{},"ISSN":["1134-5764","1863-8279"],"issn-type":[{"type":"print","value":"1134-5764"},{"type":"electronic","value":"1863-8279"}],"subject":[],"published":{"date-parts":[[2015,7,10]]}}}