{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:27Z","timestamp":1751282847276},"reference-count":11,"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\/bf02592085","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:32:15Z","timestamp":1175167935000},"page":"101-123","source":"Crossref","is-referenced-by-count":26,"title":["Packing Steiner trees: polyhedral investigations"],"prefix":"10.1007","volume":"72","author":[{"given":"M.","family":"Gr\u00f6tschel","sequence":"first","affiliation":[]},{"given":"A.","family":"Martin","sequence":"additional","affiliation":[]},{"given":"R.","family":"Weismantel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592085_CR1","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":"BF02592085_CR2","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":"BF02592085_CR3","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, A. Martin and R. Weismantel, \u201cPacking Steiner trees: a cutting plane algorithm and computational results,\u201dMathematical Programming 72 (1996) (this issue).","DOI":"10.1007\/BF02592086"},{"key":"BF02592085_CR4","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, A. Martin and R. Weismantel, \u201cPacking Steiner trees: further facets,\u201dEuropean Journal on Combinatorics, to appear.","DOI":"10.1006\/eujc.1996.0004"},{"key":"BF02592085_CR5","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":"BF02592085_CR6","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 combinatorial problems,\u201d in: R.E. Miller and J.W. Thatcher, eds.,Complexity of Computer Computations (Plenum, New York, 1972) pp. 85\u2013103."},{"key":"BF02592085_CR7","first-page":"185","volume-title":"Paths, Flows. and VLSI-Layout","author":"B. Korte","year":"1990","unstructured":"B. Korte, H.J. Pr\u00f6mel and A. Steger, \u201cSteiner trees in VLSI-layout,\u201d in: B. Korte, L. Lov\u00e1sz, H.J. Pr\u00f6mel and A. Schrijver, eds.,Paths, Flows. and VLSI-Layout (Springer, Berlin, 1990) pp. 185\u2013214."},{"key":"BF02592085_CR8","first-page":"129","volume-title":"Advances in Computing Research, Vol. 2: VLSI 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: VLSI Theory (Jai Press, London, 1984) pp. 129\u2013146."},{"key":"BF02592085_CR9","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":"BF02592085_CR10","unstructured":"A. Martin: \u201cPacken von Steinerb\u00e4umen: Polyedrische Studien und Anwendung\u201d, Ph.D. Thesis, Technische Universit\u00e4t Berlin, (1992)."},{"key":"BF02592085_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, Chichester, 1986)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592085\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592085","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\/BF02592085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF02592085"],"URL":"https:\/\/doi.org\/10.1007\/bf02592085","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}