{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:12:15Z","timestamp":1774415535074,"version":"3.50.1"},"reference-count":13,"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\/bf02071983","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T06:42:08Z","timestamp":1124001728000},"page":"471-480","source":"Crossref","is-referenced-by-count":10,"title":["An approach for the Steiner problem in directed graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Nelson","family":"Maculan","sequence":"first","affiliation":[]},{"given":"Paulo","family":"Souza","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Candia Vejar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02071983_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. Patel, Problem reduction methods and a tree generation algorithm for the Steiner network problem, Networks 17(1987)65\u201385.","journal-title":"Networks"},{"key":"BF02071983_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":"BF02071983_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"J.E. Beasley, An SST-based algorithm for the Steiner problem in graphs, Networks 19(1989)1\u201316.","journal-title":"Networks"},{"key":"BF02071983_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.3230100202","volume":"10","author":"P. Camerini","year":"1980","unstructured":"P. Camerini, L. Fratta and F. Maffioli, Thek best spanning arborescences of a network, Networks 10(1980)91\u2013110.","journal-title":"Networks"},{"key":"BF02071983_CR5","unstructured":"A. Candia, P. Souza and N. Maculan, Reduction tests for the Steiner problem in directed graphs, Working Paper."},{"key":"BF02071983_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/ADA199769","volume-title":"Directed Steiner tree problem on a graph: Models, relaxations and algorithms","author":"M. Dror","year":"1988","unstructured":"M. Dror, B. Gavish and J. Choquette, Directed Steiner tree problem on a graph: Models, relaxations and algorithms, Technical Report, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, Canada (1988)."},{"key":"BF02071983_CR7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C. Duin","year":"1989","unstructured":"C. Duin and A. Volgenant, Reduction tests for the Steiner problem in graphs, Networks 19(1989)549\u2013567.","journal-title":"Networks"},{"key":"BF02071983_CR8","volume-title":"Extended formulation and polyhedral projection","author":"W. Liu","year":"1988","unstructured":"W. Liu, Extended formulation and polyhedral projection, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Canada (1988)."},{"key":"BF02071983_CR9","first-page":"185","volume":"31","author":"N. Maculan","year":"1987","unstructured":"N. Maculan, The Steiner problem in graphs, Ann. Discr. Math. 31(1987)185\u2013212.","journal-title":"Ann. Discr. Math."},{"key":"BF02071983_CR10","volume-title":"Contribui\u00e7\u00e3o para a resolu\u00e7\u00e3o do problema de Steiner num grafo direcionado: um m\u00e9todo heur\u00edstico","author":"O.I. Palma-Pacheco","year":"1985","unstructured":"O.I. Palma-Pacheco, Contribui\u00e7\u00e3o para a resolu\u00e7\u00e3o do problema de Steiner num grafo direcionado: um m\u00e9todo heur\u00edstico, Ph.D. Thesis, Systems Engineering and Computer Sciences, COPPE, Federal University of Rio de Janeiro, Brazil (1985)."},{"key":"BF02071983_CR11","unstructured":"O.I. Palma-Pacheco and N. Maculan, M\u00e9todo heur\u00edstico para o problema de Steiner num grafo direcionado,Proc. 3rd Latin American Conf. on Operations Research and Systems Engineering, Vol. 1, Santiago, Chile (1986), pp. 117\u2013141."},{"key":"BF02071983_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, The Steiner problem in networks \u2014 A survey, Networks 17(1987)129\u2013167.","journal-title":"Networks"},{"key":"BF02071983_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong, A dual ascent approach for Steiner tree problems on a directed graph, Math. Progr. 28(1984)271\u2013287.","journal-title":"Math. Progr."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02071983.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02071983\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02071983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:06:44Z","timestamp":1557778004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02071983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF02071983"],"URL":"https:\/\/doi.org\/10.1007\/bf02071983","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}