{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:02:13Z","timestamp":1747627333383,"version":"3.40.5"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1014553523631","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T20:42:43Z","timestamp":1041108163000},"page":"47-61","source":"Crossref","is-referenced-by-count":9,"title":["An Augmented Arborescence Formulation for the Two-Level Network Design Problem"],"prefix":"10.1007","volume":"106","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Telhada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"398737_CR1","volume-title":"Network Flow: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"R. Ahuja, T. Magnanti and J. Orlin, Network Flow: Theory, Algorithms and Applications (Prentice\u2013Hall, Englewood Cliffs, NJ, 1993)."},{"issue":"7","key":"398737_CR2","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"A. Balakrishnan, T. Magnanti and P. Mirchandani, Modeling and heuristic worst\u2013case performance analysis of the two\u2013level network design problem, Management Science 40(7) (1994) 846\u2013867.","journal-title":"Management Science"},{"issue":"5","key":"398737_CR3","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"A. Balakrishnan, T. Magnanti and P. Mirchandani, Dual\u2013based algorithm for multi\u2013level network design, Management Science 40(5) (1994) 567\u2013581.","journal-title":"Management Science"},{"key":"398737_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0377-2217(86)80007-8","volume":"27","author":"J.R. Current","year":"1986","unstructured":"J.R. Current, C.S. Revelle and J.L. Cohon, The hierarchical network design problem, European Journal of Operational Research 27 (1986) 57\u201366.","journal-title":"European Journal of Operational Research"},{"key":"398737_CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02071982","volume":"33","author":"C. Duin","year":"1991","unstructured":"C. Duin and T. Volgenant, The multi\u2013weighted Steiner tree problem, Annals of Operations Research 33 (1991) 451\u2013469.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"398737_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","volume":"5","author":"M. Fischetti","year":"1993","unstructured":"M. Fischetti, and P. Toth, An efficient algorithm for the min\u2013sum arborescence problem on complete digraphs, ORSA Journal on Computing 5(4) (1993) 426\u2013434.","journal-title":"ORSA Journal on Computing"},{"key":"398737_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"M. Goemans","year":"1993","unstructured":"M. Goemans and Y. Myung, A catalog of Steiner tree formulations, Networks 23 (1993) 19\u201328.","journal-title":"Networks"},{"key":"398737_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe, and H.P. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62\u201388.","journal-title":"Mathematical Programming"},{"key":"398737_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.W. Hwang","year":"1992","unstructured":"F.W. Hwang and D.S. Richards, Steiner tree problems, Networks 22 (1992) 55\u201390.","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"B.N. Khoury, P.M. Pardalos and D.W. Hearn, Equivalent formulations for the Steiner problem in graphs, in: Network Optimization Problems, eds. D.\u2013Z. Du and P.M. Pardalos (1993) pp. 111\u2013123.","key":"398737_CR10","DOI":"10.1142\/9789812798190_0007"},{"key":"398737_CR11","first-page":"503","volume":"7","author":"T.L. Magnanti","year":"1995","unstructured":"T.L. Magnanti and L.A. Wolsey, Optimal trees, in: Handbooks in OR & MS, Vol. 7, eds. M.O. Ball et al. (1995) pp. 503\u2013615.","journal-title":"Handbooks in OR & MS"},{"unstructured":"S. Voss, Steiner Probleme in Graphen, Mathematical Systems in Economics (1990).","key":"398737_CR12"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014553523631.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014553523631\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014553523631.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:23:29Z","timestamp":1747578209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014553523631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":12,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["398737"],"URL":"https:\/\/doi.org\/10.1023\/a:1014553523631","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}