{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T23:13:33Z","timestamp":1785971613372,"version":"3.56.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1007\/bf02612335","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T06:50:56Z","timestamp":1177656656000},"page":"271-287","source":"Crossref","is-referenced-by-count":268,"title":["A dual ascent approach for steiner tree problems on a directed graph"],"prefix":"10.1007","volume":"28","author":[{"given":"Richard T.","family":"Wong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02612335_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Y.P. Aneja, \u201cAn integer linear programming approach to the Steiner problem in graphs\u201d,Networks 10 (1980) 167\u2013178.","journal-title":"Networks"},{"key":"BF02612335_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume":"1","author":"O. Bilde","year":"1977","unstructured":"O. Bilde and J. Krarup, \u201cSharp lower bounds and efficient algorithms for the simple plant location problem\u201d,Annals of Discrete Mathematics 1 (1977) 79\u201397.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02612335_CR3","first-page":"1396","volume":"14","author":"Y.J. Chu","year":"1965","unstructured":"Y.J. Chu and T.H. Liu, \u201cOn the shortest arborescences of a directed graph\u201d,Scientia Sinica 14 (1965) 1396\u20131400.","journal-title":"Scientia Sinica"},{"key":"BF02612335_CR4","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"G. Cornuejols, M.L. Fisher and G.L. Nemhauser, \u201cLocation of bank accounts to optimize float: An analytic study of exact and approximate algorithms\u201d,Management Science 23 (1977) 789\u2013810.","journal-title":"Management Science"},{"key":"BF02612335_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"S.E. Dreyfus and R.A. Wagner, \u201cThe Steiner problem in graphs\u201d,Networks 1 (1972) 195\u2013207.","journal-title":"Networks"},{"key":"BF02612335_CR6","first-page":"233","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cOptimum branchings\u201d,Journal of Research of the National Bureau of Standards\u2014B. Mathematics and Mathematical Physics 71B (1967) 233\u2013240.","journal-title":"Journal of Research of the National Bureau of Standards\u2014B. Mathematics and Mathematical Physics"},{"key":"BF02612335_CR7","volume-title":"Minimum concave cost network flows","author":"R.E. Erickson","year":"1981","unstructured":"R.E. Erickson, C.L. Monma and A.F. Veinott, Jr., \u201cMinimum concave cost network flows\u201d, unpublished manuscript, Bell Laboratories (Holmdel, NJ, 1981)."},{"key":"BF02612335_CR8","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter, \u201cA dual-based procedure for uncapacitated facility location\u201d,Operations Research 26 (1978) 992\u20131009.","journal-title":"Operations Research"},{"key":"BF02612335_CR9","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322217.322226","volume":"27","author":"M.L. Fisher","year":"1980","unstructured":"M.L. Fisher and D.S. Hochbaum, \u201cDatabase location in computer networks\u201d,Journal of the ACM 27 (1980) 718\u2013735.","journal-title":"Journal of the ACM"},{"key":"BF02612335_CR10","unstructured":"M.L. Fisher, R. Jaikumar and L. Van Wassenhov, \u201cA multiplier adjustment method for the generalized assignment problem\u201d, contributed paper, ORSA\/TIMS Meeting, Washington, D.C., May 1980."},{"key":"BF02612335_CR11","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and intractability: A guide to the theory of NP-completeness (W.H. Freeman and Co., San Francisco 1979)."},{"key":"BF02612335_CR12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01588244","volume":"17","author":"M. Guignard","year":"1979","unstructured":"M. Guignard and K. Spielberg, \u201cA direct dual method for the mixed plant location problem with some side constraints\u201d,Mathematical Programming 17 (1979) 198\u2013228.","journal-title":"Mathematical Programming"},{"key":"BF02612335_CR13","series-title":"Technical Report","volume-title":"A direct dual approach to a transshipment formulation for multi-layer network problems with fixed charges","author":"M. Guignard","year":"1979","unstructured":"M. Guignard and K. Spielberg, \u201cA direct dual approach to a transshipment formulation for multi-layer network problems with fixed charges\u201d, Technical Report 43, Department of Statistics, University of Pennsylvania, (Philadelphia, PA, 1979)."},{"key":"BF02612335_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S.L. Hakirni","year":"1971","unstructured":"S.L. Hakirni, \u201cSteiner's problem in graphs and its implications\u201d,Networks 1 (1971) 113\u2013133.","journal-title":"Networks"},{"key":"BF02612335_CR15","volume-title":"Combinatorial optimization: Networks and matroids","author":"E. Lawler","year":"1976","unstructured":"E. Lawler,Combinatorial optimization: Networks and matroids (Holt, Reinhart and Winston, New York, 1976)."},{"key":"BF02612335_CR16","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T.L. Magnanti","year":"1981","unstructured":"T.L. Magnanti and R.T. Wong, \u201cAccelerating Benders decomposition: Algorithmic enhancement and model selection criteria\u201d,Operations Research 29 (1981) 464\u2013484.","journal-title":"Operations Research"},{"key":"BF02612335_CR17","doi-asserted-by":"crossref","unstructured":"T.L. Magnanti and R.T. Wong, \u201cNetwork design and transportation planning: Models and algorithms\u201d,Transportation Science, to appear.","DOI":"10.1287\/trsc.18.1.1"},{"key":"BF02612335_CR18","series-title":"Technical Report TR-15-75","volume-title":"Analysis of stochastic networks in emergency service systems","author":"P.B. Mirchandani","year":"1975","unstructured":"P.B. Mirchandani, \u201cAnalysis of stochastic networks in emergency service systems\u201d, Technical Report TR-15-75, Innovative Resources Planning Project, massachusetts Institute of Technology (Cambridge, MA, 1975)."},{"key":"BF02612335_CR19","series-title":"Technical Report J-82-3","volume-title":"Tight relaxations of fixed charge network flow problems","author":"R.L. Rardin","year":"1982","unstructured":"R.L. Rardin, \u201cTight relaxations of fixed charge network flow problems\u201d, Technical Report J-82-3, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1982)."},{"key":"BF02612335_CR20","series-title":"Technical Report J-82-2","volume-title":"Some polynomially solvable multi-commodity fixed charge network flow problems","author":"R.L. Rardin","year":"1982","unstructured":"R.L. Rardin, R.G. Parker and W.K. Lim, \u201cSome polynomially solvable multi-commodity fixed charge network flow problems\u201d, Technical Report J-82-2, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1982)."},{"key":"BF02612335_CR21","first-page":"614","volume-title":"Proceedings of the Princeton symposium on mathematical programming","author":"J. Suurballe","year":"1970","unstructured":"J. Suurballe, \u201cAlgorithms for minimal trees and semi-Steiner trees based on the simplex method\u201d, in: H.W. Kuhn, ed. Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton, NJ, 1970) pp. 614\u2013615."},{"key":"BF02612335_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"R.E. Tarjan","year":"1977","unstructured":"R.E. Tarjan, \u201cFinding optimum branchings\u201d,Networks 7 (1977) 25\u201335.","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612335.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02612335\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:34:25Z","timestamp":1558341265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02612335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF02612335"],"URL":"https:\/\/doi.org\/10.1007\/bf02612335","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}