{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:14:03Z","timestamp":1780384443411,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1007\/bf02592086","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:32:15Z","timestamp":1175167935000},"page":"125-145","source":"Crossref","is-referenced-by-count":47,"title":["Packing Steiner trees: a cutting plane algorithm and computational results"],"prefix":"10.1007","volume":"72","author":[{"given":"M.","family":"Gr\u00f6tschel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Martin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02592086_CR1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, \u201cPartitioning procedures for solving mixed-variables programming problems,\u201dNumerische Mathematik 4 (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"BF02592086_CR2","first-page":"245","volume-title":"Advances in Computing Research. Vol. 2: VLSI Theory","author":"M.L. Brady","year":"1984","unstructured":"M.L. Brady and D.J. Brown, \u201cVLSI routing: Four layers suffice,\u201d in: F.P. Preparata, ed.,Advances in Computing Research. Vol. 2: VLSI Theory (Jai Press, London, 1984) pp. 245\u2013258."},{"key":"BF02592086_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TCAD.1983.1270040","volume":"2","author":"M. Burstein","year":"1983","unstructured":"M. Burstein and R. Pelavin, \u201cHierarchical wire routing,\u201dIEEE Transactions on Computer-Aided-Design CAD-2 (1983) 223\u2013234.","journal-title":"IEEE Transactions on Computer-Aided-Design CAD"},{"key":"BF02592086_CR4","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/43.3208","volume":"7","author":"J.P. Cohoon","year":"1988","unstructured":"J.P. Cohoon and P.L. Heck, \u201cBEAVER: A computational-geometry-based tool for switchbox routing,\u201dIEEE Transactions on Computer-Aided-Design CAD-7 (1988) 684\u2013697.","journal-title":"IEEE Transactions on Computer-Aided-Design CAD"},{"key":"BF02592086_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe, \u201cDecomposition principle for linear programs,\u201dOperations Research 8 (1960) 101\u2013111.","journal-title":"Operations Research"},{"key":"BF02592086_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"S.E. Dreyfus and R.A. Wagner, \u201cThe Steiner problem in graphs,\u201dNetworks 1 (1971) 195\u2013207.","journal-title":"Networks"},{"key":"BF02592086_CR7","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R.E. Erickson","year":"1987","unstructured":"R.E. Erickson, C.L. Monma and A.F. Veinott, \u201cSend-and-split method for minimum concave-cost network flows,\u201dMathematics of Operations Research 12 (1987) 634\u2013664.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592086_CR8","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, \u201cThe rectilinear Steiner tree problem is -complete,\u201dSIAM Journal on Applied Mathematics 32 (1977) 826\u2013834.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"BF02592086_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M. Gr\u00f6tschel","year":"1991","unstructured":"M. Gr\u00f6tschel and O. Holland, \u201cSolution of large-scale symmetric travelling salesman problems,\u201dMathematical Programming 51 (1991) 141\u2013202.","journal-title":"Mathematical Programming"},{"key":"BF02592086_CR10","first-page":"255","volume":"41","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"M. Gr\u00f6tschel, A. Martin and R. Weismantel, \u201cRouting in Grid Graphs by Cutting Planes,\u201dZeitschrift f\u00fcr Operations Research 41 (1995) 255\u2013275.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"BF02592086_CR11","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, A. Martin and R. Weismantel, \u201cPacking Steiner trees: separation algorithms,\u201dSIAM Journal on Discrete Mathematics, to appear.","DOI":"10.1137\/S0895480193258716"},{"key":"BF02592086_CR12","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, A. Martin and R. Weismantel, \u201cPacking Steiner trees: polyhedral investigations,\u201d Mathematical Programming 72 (1996) (this issue).","DOI":"10.1007\/BF02592085"},{"key":"BF02592086_CR13","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and C.L. Monma, \u201cInteger polyhedra associated with certain network design problems with connectivity constraints,\u201dSIAM Journal on Discrete Mathematics 3 (1990) 502\u2013523.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02592086_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"M. Gr\u00f6tschel, C.L. Monma and M. Stoer, \u201cComputational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints,\u201dOperations Research 40 (1992) 309\u2013330.","journal-title":"Operations Research"},{"key":"BF02592086_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinational problems,\u201d in: R.E. Miller and J.W. Thatcher, eds.,Complexity of Computer Computations (Plenum, New York, 1972) pp. 85\u2013103."},{"key":"BF02592086_CR16","first-page":"129","volume-title":"Advances in Computing Research, Vol. 2: VSLI Theory","author":"M.R. Kramer","year":"1984","unstructured":"M.R. Kramer and J. van Leeuwen, \u201cThe complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits,\u201d in: F.P. Preparata, ed.,Advances in Computing Research, Vol. 2: VSLI Theory (Jai Press, London, 1984) pp. 129\u2013146."},{"key":"BF02592086_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Wiley, Chichester, 1990)."},{"key":"BF02592086_CR18","first-page":"231","volume-title":"Advances in Computing Research, Vol. 2: VLSI Theory","author":"W. Lipski","year":"1984","unstructured":"W. Lipski, \u201cOn the structure of three-layer wireable layouts,\u201d in: F.P. Preparata, ed.,Advances in Computing Research, Vol. 2: VLSI Theory (Jai Press, London, 1984) pp. 231\u2013244."},{"key":"BF02592086_CR19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-9260(85)90029-X","volume":"3","author":"W.K. Luk","year":"1985","unstructured":"W.K. Luk, \u201cA greedy switch-box router,\u201dIntegration 3 (1985) 129\u2013149.","journal-title":"Integration"},{"key":"BF02592086_CR20","unstructured":"A. Martin, \u201cPacken von Steinerb\u00e4umen: Polyedrische Studien und Anwendung,\u201d Ph.D. Thesis, Technische Universit\u00e4t Berlin, (1992)."},{"key":"BF02592086_CR21","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"M. Padberg and G. Rinaldi, \u201cA branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems,\u201dSIAM Review 33 (1991) 60\u2013100.","journal-title":"SIAM Review"},{"key":"BF02592086_CR22","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TCAD.1987.1270298","volume":"6","author":"M. Sarrafzadeh","year":"1987","unstructured":"M. Sarrafzadeh, \u201cChannel-routing problem in the knock-knee mode is -complete,\u201dIEEE Transactions on Computer-Aided-Design CAD-6 (1987) 503\u2013506.","journal-title":"IEEE Transactions on Computer-Aided-Design CAD"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592086\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T23:32:58Z","timestamp":1587425578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF02592086"],"URL":"https:\/\/doi.org\/10.1007\/bf02592086","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}