{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:15Z","timestamp":1751367975325},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1007\/bf02071982","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T10:42:08Z","timestamp":1124016128000},"page":"451-469","source":"Crossref","is-referenced-by-count":20,"title":["The multi-weighted Steiner tree problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Cees","family":"Duin","sequence":"first","affiliation":[]},{"given":"Ton","family":"Volgenant","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02071982_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230170107","volume":"17","author":"A. Balakrishnan","year":"1987","unstructured":"A. Balakrishnan and N.R. Patel, Problem reduction methods and a tree generation algorithm for the Steiner network problem, Networks 17(1987)65\u201385.","journal-title":"Networks"},{"key":"BF02071982_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","volume":"14","author":"J.E. Beasley","year":"1984","unstructured":"J.E. Beasley, An algorithm for the Steiner problem in graphs, Networks 14(1984)147\u2013159.","journal-title":"Networks"},{"key":"BF02071982_CR3","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, Eur. J. Oper. Res. 27(1986)57\u201366.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02071982_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/net.3230170309","volume":"17","author":"C.W. Duin","year":"1987","unstructured":"C.W. Duin and A. Volgenant, Some generalizations of the Steiner problem in graphs, Networks 17(1987)353\u2013364.","journal-title":"Networks"},{"key":"BF02071982_CR5","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0377-2217(89)90170-7","volume":"39","author":"C.W. Duin","year":"1989","unstructured":"C.W. Duin and A. Volgenant, Reducing the hierarchical network design problem, Eur. J. Oper. Res. 39(1989)332\u2013344.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02071982_CR6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C.W. Duin","year":"1989","unstructured":"C.W. Duin and A. Volgenant, Reduction tests for the Steiner problem in graphs, Networks 19(1989)549\u2013567.","journal-title":"Networks"},{"key":"BF02071982_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(89)90005-9","volume":"8","author":"C.W. Duin","year":"1989","unstructured":"C.W. Duin and A. Volgenant, An edge elimination test for the Steiner problem in graphs, Oper. Res. Lett. 8(1989)79\u201383.","journal-title":"Oper. Res. Lett."},{"key":"BF02071982_CR8","first-page":"23","volume-title":"Twenty-five Years of Operations Research in The Netherlands: Papers dedicated to Gijs de Leve","author":"C.W. Duin","year":"1990","unstructured":"C.W. Duin and A. Volgenant, Heuristics for the hierarchical network design problem, in:Twenty-five Years of Operations Research in The Netherlands: Papers dedicated to Gijs de Leve, ed. J.K. Lenstra, H. Tijms and A. Volgenant, CWI Tract 70 (Centre for Mathematics and Computer Science, Amsterdam, 1990), pp. 23\u201334."},{"key":"BF02071982_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1(1959)269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"BF02071982_CR10","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32(1977)826\u2013834.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02071982_CR11","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish, Topological design of centralized computer networks \u2014 formulations and algorithms, Networks 12(1982)355\u2013377.","journal-title":"Networks"},{"key":"BF02071982_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15(1981)141\u2013145.","journal-title":"Acta Informatica"},{"key":"BF02071982_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Info. Proc. Lett. 27(1988)125\u2013128.","journal-title":"Info. Proc. Lett."},{"key":"BF02071982_CR14","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim, Shortest connection networks and some generalizations, Bell. Syst. Tech. J. 36(1957)1389\u20131401.","journal-title":"Bell. Syst. Tech. J."},{"key":"BF02071982_CR15","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica 24(1980) 573\u2013577.","journal-title":"Math. Japonica"},{"key":"BF02071982_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00289500","volume":"23","author":"Y.F. Wu","year":"1986","unstructured":"Y.F. Wu, P. Widmayer and C.K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Informatica 23(1986)223\u2013229.","journal-title":"Acta Informatica"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02071982.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02071982\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02071982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:06:44Z","timestamp":1557792404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02071982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF02071982"],"URL":"https:\/\/doi.org\/10.1007\/bf02071982","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}