{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:52Z","timestamp":1759063852351},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1007\/bf01582065","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:37:34Z","timestamp":1114677454000},"page":"183-191","source":"Crossref","is-referenced-by-count":23,"title":["Tree polytope on 2-trees"],"prefix":"10.1007","volume":"63","author":[{"given":"F.","family":"Margot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Prodon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Th. M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"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,\u201dNetworks 10 (1980) 167\u2013178.","journal-title":"Networks"},{"key":"CR2","volume-title":"\u201cTwo terminal Steiner tree polyhedra,\u201d Research Report CORR 87-33","author":"M.O. Ball","year":"1987","unstructured":"M.O. Ball, W.-G. Liu and W.R. Pulleyblank, \u201cTwo terminal Steiner tree polyhedra,\u201d Research Report CORR 87-33, University of Waterloo (Waterloo, Ont., 1987)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230200110","volume":"20","author":"M.W. Bern","year":"1990","unstructured":"M.W. Bern, \u201cFaster exact algorithms for Steiner tree in planar networks,\u201dNetworks 20 (1990) 109\u2013120.","journal-title":"Networks"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R.B. Borie","year":"1992","unstructured":"R.B. Borie, R.G. Parker and C.A. Tovey, \u201cAutomatic generation of linear time algorithms from predicate calculus descriptions of problems on recursively constructed graph families,\u201dAlgorithmica 7 (1992) 555\u2013582.","journal-title":"Algorithmica"},{"key":"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,\u201dNetworks 1 (1972) 195\u2013207.","journal-title":"Networks"},{"key":"CR6","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"CR7","volume-title":"\u201cTree polyhedron on 2-tree and (n \u2212 2,n) Steiner polyhedron,\u201d Technical Report RO 910222","author":"F. Margot","year":"1991","unstructured":"F. Margot, A. Prodon and Th.M. Liebling, \u201cTree polyhedron on 2-tree and (n \u2212 2,n) Steiner polyhedron,\u201d Technical Report RO 910222, D\u00e9partement de Math\u00e9matiques, EPF Lausanne (Lausanne, 1991)."},{"key":"CR8","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, \u201cA faster approximation algorithm for the Steiner problem in graphs,\u201dInformation Processing Letters 27 (1988) 125\u2013128.","journal-title":"Information Processing Letters"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-6377(92)90075-E","volume":"11","author":"A. Prodon","year":"1992","unstructured":"A. Prodon, \u201cSteiner trees withn terminals amongn + 1 nodes,\u201dOperations Research Letters 11 (1992) 125\u2013133.","journal-title":"Operations Research Letters"},{"key":"CR10","volume-title":"\u201cSteiner's problem on two-trees,\u201d Technical Report RO 850315","author":"A. Prodon","year":"1985","unstructured":"A. Prodon, Th.M. Liebling and H. Gr\u00f6fflin, \u201cSteiner's problem on two-trees,\u201d Technical Report RO 850315, D\u00e9partment de Math\u00e9matiques, EPF Lausanne (Lausanne, 1985)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01553886","volume":"4","author":"D. Richards","year":"1989","unstructured":"D. Richards, \u201cFast heuristic algorithms for rectilinear Steiner trees,\u201dAlgorithmica 4 (1989) 191\u2013207.","journal-title":"Algorithmica"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J.A. Wald","year":"1983","unstructured":"J.A. Wald and C.J. Colbourn, \u201cSteiner trees, partial 2-trees and minimum IFI networks,\u201dNetworks 13 (1983) 159\u2013167.","journal-title":"Networks"},{"key":"CR13","first-page":"43","volume":"50","author":"T.V. Wiemer","year":"1985","unstructured":"T.V. Wiemer, S.T. Hedetniemi and R. Laskar, \u201cA methodology for constructing linear graph algorithms,\u201dCongressus Numerantium 50 (1985) 43\u201360.","journal-title":"Congressus Numerantium"},{"key":"CR14","volume-title":"Proceedings of the 12th International Symposium on Mathematical Programming","author":"P. Winter","year":"1985","unstructured":"P. Winter, \u201cGeneralized Steiner problem in Halin networks,\u201dProceedings of the 12th International Symposium on Mathematical Programming (MIT, Cambridge, MA, 1985)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong, \u201cA dual ascent approach for Steiner tree problems on a directed graph,\u201dMathematical Programming 28 (1984) 271\u2013287.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582065.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582065\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:44Z","timestamp":1556896544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01582065"],"URL":"https:\/\/doi.org\/10.1007\/bf01582065","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}