{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:28Z","timestamp":1770994048258,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,2,1]],"date-time":"1974-02-01T00:00:00Z","timestamp":128908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1974,2]]},"DOI":"10.1007\/bf01949715","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T18:56:12Z","timestamp":1122836172000},"page":"59-67","source":"Crossref","is-referenced-by-count":20,"title":["Cost-minimal trees in directed acyclic graphs"],"prefix":"10.1007","volume":"18","author":[{"given":"L.","family":"Nastansky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Selkow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. F.","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01949715_CR1","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"Balas, E.: An additive algorithm for solving linear programs with zero-one variables. Operations Res.13, 517\u2013546, 1965.","journal-title":"Operations Res."},{"key":"BF01949715_CR2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1111\/j.1558-5646.1965.tb01722.x","volume":"19","author":"J. H. Camin","year":"1965","unstructured":"Camin, J. H., andR. R. Sokal: A method for deducing branching sequences in phylogeny. Evolution19, 311\u2013326, 1965.","journal-title":"Evolution"},{"issue":"No. 4","key":"BF01949715_CR3","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1145\/321724.321733","volume":"19","author":"S. K. Chang","year":"1972","unstructured":"Chang, S. K.: The Generation of Minimal Trees with a Steiner Topology. JACM19, No. 4, 699\u2013711, 1972.","journal-title":"JACM"},{"key":"BF01949715_CR4","volume-title":"What is Mathematics?","author":"R. Courant","year":"1941","unstructured":"Courant, R., andH. Robbins: What is Mathematics? Oxford University Press, New York 1941."},{"key":"BF01949715_CR5","volume-title":"Report ORC 70-32","author":"S. F. Dreyfus","year":"1970","unstructured":"Dreyfus, S. F., andR. A. Wagner: The Steiner Problem in Graphs. Report ORC 70-32, University of California, Berkeley, California September 1970."},{"issue":"No. 2","key":"BF01949715_CR6","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/1009031","volume":"9","author":"A. M. Geoffrion","year":"1967","unstructured":"Geoffrion, A. M.: Integer programming by implicit enumeration and Balas' method. SIAM Review9, No. 2, 178\u2013190, 1967.","journal-title":"SIAM Review"},{"issue":"No. 1","key":"BF01949715_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E. N. Gilbert","year":"1967","unstructured":"Gilbert, E. N., andH. O. Pollak: Steiner minimal trees. SIAM J. Appl. Math.16, No. 1, 1\u201328, 1967.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01949715_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S. L. Hakimi","year":"1971","unstructured":"Hakimi, S. L.: Steiner's problem in graphs and its implications. Networks1, 113\u2013133, 1971.","journal-title":"Networks"},{"issue":"No. 2","key":"BF01949715_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"Hanan, M.: On Steiner's problem with rectilinear distance. SIAM J. Appl. Math.14, No. 2, 255\u2013265, 1966.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01949715_CR10","volume-title":"Ph. D. thesis","author":"J. A. Hendrickson Jr.","year":"1967","unstructured":"Hendrickson, J. A. Jr.: A methodological analysis of numerical cladistics. Ph. D. thesis, University of Kansas, Lawrence, Kansas 1967."},{"key":"BF01949715_CR11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0025-5564(68)90092-8","volume":"3","author":"J. A. Hendrickson Jr.","year":"1968","unstructured":"Hendrickson, J. A. Jr.: Clustering in numerical cladistics: a minimum-length directed tree problem. Mathematical Biosciences3, 371\u2013381, 1968.","journal-title":"Mathematical Biosciences"},{"key":"BF01949715_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"4","author":"Z. A. Melzak","year":"1961","unstructured":"Melzak, Z. A.: On the problem of Steiner. Canad. Math. Bull.4, 143\u2013148, 1961.","journal-title":"Canad. Math. Bull."}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01949715.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01949715\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01949715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:59:45Z","timestamp":1557752385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01949715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,2]]}},"alternative-id":["BF01949715"],"URL":"https:\/\/doi.org\/10.1007\/bf01949715","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,2]]}}}