{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:19:17Z","timestamp":1726413557207},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10479-006-0049-0","type":"journal-article","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T20:23:43Z","timestamp":1151353423000},"page":"19-39","source":"Crossref","is-referenced-by-count":7,"title":["An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees"],"prefix":"10.1007","volume":"146","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"49_CR1","unstructured":"Abdalla, A., N. Deo, and R. Fraceschini. (1999). \u201cParallel Heuristics for the Diameter-Constrained Minimum Spanning Tree Problem.\u201d Congressus Numeratium, 136, 97\u2013118."},{"key":"49_CR2","unstructured":"Achuthan, N.R., L. Caccetta, P. Caccetta, and J.F. Geelen. (1992). \u201cAlgorithms for the Minimum Weight Spanning Tree with Bounded Diameter Problem.\u201d In P.K.H. Phua, C.M. Wang, W.Y. Yeong, T.Y. Leong, H.T. Loh, K.C. Tan, and F.S. Chou (eds.), Optimization: Techniques and Applications, Vol. 1. World Scientific Publishing, pp. 297\u2013304."},{"key":"49_CR3","first-page":"51","volume":"10","author":"N.R. Achuthan","year":"1994","unstructured":"Achuthan, N.R., L. Caccetta, P. Caccetta, and J.F. Geelen. (1994). \u201cComputational Methods for the Diameter Restricted Minimum Weight Spanning Tree Problem.\u201d Australasian Journal of Combinatorics 10, 51\u201371.","journal-title":"Australasian Journal of Combinatorics"},{"key":"49_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M. and D. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco."},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L. (1998). \u201cUsing Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints.\u201d INFORMS Journal on Computing, 10, 180\u2013188.","journal-title":"INFORMS Journal on Computing"},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"L. Gouveia","year":"2003","unstructured":"Gouveia, L. and T. Magnanti. (2003). \u201cNetwork Flow Models for Designing Diameter Constrained Spanning and Steiner Trees.\u201d Networks, 41, 159\u2013173.","journal-title":"Networks"},{"key":"49_CR7","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/net.20034","volume":"44","author":"L Gouveia","year":"2004","unstructured":"Gouveia, L, T. Magnanti, and C. Requejo. (2004). \u201cA 2-Path Approach for Odd-Diameter-Constrained Minimum Spanning and Steiner Trees.\u201d Networks, 44, 254\u2013265.","journal-title":"Networks"},{"key":"49_CR8","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","volume":"7","author":"T. Magnanti","year":"1996","unstructured":"Magnanti, T. and L. Wolsey. (1996). \u201cOptimal Trees\u201d in \u201cNetwork Models.\u201d Handbooks in Operations Research and Management Science, 7, 503\u2013615.","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"49_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. Magnanti","year":"1984","unstructured":"Magnanti, T. and R. Wong. (1984). \u201cNetwork Design and Transportation Planning: Models and Algorithms.\u201d Transportation Science, 18, 1\u201355.","journal-title":"Transportation Science"},{"key":"49_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(88)90033-0","volume":"15","author":"K. Woolston","year":"1988","unstructured":"Woolston, K. and S. Albin. (1988). \u201cThe Design of Centralized Networks with Reliability and Availability Constraints.\u201d Computers and Operations Research, 15, 207\u2013217.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0049-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0049-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0049-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:32Z","timestamp":1559153252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0049-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["49"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0049-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2006,6,27]]}}}