{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T14:28:28Z","timestamp":1780064908767,"version":"3.54.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T00:00:00Z","timestamp":1337040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00186-012-0391-8","type":"journal-article","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T11:51:41Z","timestamp":1336996301000},"page":"95-123","source":"Crossref","is-referenced-by-count":4,"title":["Steiner tree packing revisited"],"prefix":"10.1007","volume":"76","author":[{"given":"Nam-D\u0169ng","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,5,15]]},"reference":[{"key":"391_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg T, Raack C (2010) The MCF-separator\u2014detecting and exploiting multi-commodity flows in MIPs. Math Program C, pp 125\u2013165","DOI":"10.1007\/s12532-010-0015-3"},{"key":"391_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E Balas","year":"1980","unstructured":"Balas E, Martin C (1980) Pivot and complement\u2014a heuristic for 0\/1 programming. Manag Sci 26: 86\u201396","journal-title":"Manag Sci"},{"key":"391_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.disopt.2004.03.001","volume":"1","author":"E Balas","year":"2004","unstructured":"Balas E, Schmietab S, Wallacea C (2004) Pivot and shift\u2014a mixed integer programming heuristic. Discret Optim 1: 3\u201312","journal-title":"Discret Optim"},{"key":"391_CR4","unstructured":"Boit C (2004) Personal communication"},{"key":"391_CR5","first-page":"245","volume-title":"Advances in computing research: VLSI theory","author":"ML Brady","year":"1984","unstructured":"Brady ML, Brown DJ (1984) VLSI routing: four layers suffice. In: Preparata FP (ed) Advances in computing research: VLSI theory. Jai Press, London, pp 245\u2013258"},{"key":"391_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TCAD.1983.1270040","volume":"2","author":"M Burstein","year":"1983","unstructured":"Burstein M, Pelavin R (1983) Hierachical wire routing. IEEE Trans Computer Aided Des 2: 223\u2013234","journal-title":"IEEE Trans Computer Aided Des"},{"key":"391_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02085638","volume":"50","author":"S Chopra","year":"1994","unstructured":"Chopra S (1994) Comparison of formulations and a heuristic for packing Steiner trees in a graph. Ann Oper Res 50: 143\u2013171","journal-title":"Ann Oper Res"},{"key":"391_CR8","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/43.3208","volume":"7","author":"JP Coohoon","year":"1988","unstructured":"Coohoon JP, Heck PL (1988) BEAVER: a computational-geometry-based tool for switchbox routing. IEEE Trans Comput Aided Des 7: 684\u2013697","journal-title":"IEEE Trans Comput Aided Des"},{"key":"391_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/zamm.19890691107","volume":"69","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1989) Via minimization with pin preassignments and layer preference. Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik 69: 393\u2013399","journal-title":"Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik"},{"key":"391_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592086","volume":"72","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1996) Packing steiner trees: a cutting plane algorithm and computational results. Math. Program 72: 125\u2013145","journal-title":"Math. Program"},{"key":"391_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1006\/eujc.1996.0004","volume":"17","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1996) Packing steiner trees: further facets. Eur J Comb 17: 39\u201352","journal-title":"Eur J Comb"},{"key":"391_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02592085","volume":"72","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1996) Packing steiner trees: polyhedral investigations. Math Program 72: 101\u2013123","journal-title":"Math Program"},{"key":"391_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02614374","volume":"78","author":"M Gr\u00f6tschel","year":"1997","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1997) The steiner tree packing problem in VLSI design. Math Program 78: 265\u2013281","journal-title":"Math Program"},{"key":"391_CR14","unstructured":"Held S, Korte B, Rautenbach D, Vygen J (2011) Combinatorial optimization in VLSI design. In: Chv\u00e1tal V (ed) Combinatorial optimization\u2014methods and applications, vol 31 of NATO science for peace and security series\u2014D: information and communication security, pp 33\u201396"},{"key":"391_CR15","unstructured":"J\u00f8rgensen DG, Meyling M (2000) Application of column generation techniques in VLSI design. Master\u2019s thesis, Department of Computer Science, University of Copenhagen"},{"key":"391_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01582072","volume":"63","author":"M J\u00fcnger","year":"1994","unstructured":"J\u00fcnger M, Martin A, Reinelt G, Weismantel R (1994) Quadratic 0\/1 optimization and a decomposition approach for the placement of electronic circuits. Math Program 63: 257\u2013279","journal-title":"Math Program"},{"key":"391_CR17","unstructured":"Koch T ZIMPL. http:\/\/zimpl.zib.de"},{"key":"391_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T Koch","year":"1998","unstructured":"Koch T, Martin A (1998) Solving steiner tree problems in graphs to optimality. Networks 32: 207\u2013232","journal-title":"Networks"},{"key":"391_CR19","volume-title":"Paths, flows, and VLSI-layout","author":"B Korte","year":"1990","unstructured":"Korte B, Pr\u00f6mel H-J, Steger A (1990) Steiner trees in VLSI-layout. In: Korte B, Lov\u00e1sz L, Pr\u00f6mel H-J, Schrijver A (eds) Paths, flows, and VLSI-layout. Springer, Berlin"},{"key":"391_CR20","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":"Lengauer T (1990) Combinatorial algorithms for integrated circuit layout. Wiley, London"},{"key":"391_CR21","first-page":"231","volume-title":"Advances in computing research: VLSI theory","author":"W Lipski","year":"1984","unstructured":"Lipski W (1984) On the structure of three-layer wireable layouts. In: Preparata FP (ed) Advances in computing research: VLSI theory. Jai Press, Wiley, London, pp 231\u2013244"},{"key":"391_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-9260(85)90029-X","volume":"3","author":"WK Luk","year":"1985","unstructured":"Luk WK (1985) A greedy switch-box router. Integration 3: 129\u2013149","journal-title":"Integration"},{"key":"391_CR23","unstructured":"Martin A (1992) Packen von Steinerb\u00e4umen: Polyedrische Studien und Anwendungen. PhD thesis, Technische Universit\u00e4t Berlin"},{"key":"391_CR24","unstructured":"Polzin T (2003) Algorithms for the steiner problem in networks. PhD thesis, Universit\u00e4t des Saarlandes"},{"key":"391_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C Raack","year":"2011","unstructured":"Raack C, Koster AMCA, Orlowski S, Wessly R (2011) On cut-based inequalities for capacitated network design polyhedra. Networks 57: 141\u2013156","journal-title":"Networks"},{"key":"391_CR26","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"RT Wong","year":"1984","unstructured":"Wong RT (1984) A dual ascent approach for steiner tree problems on a directed graph. Math Program 28: 271\u2013287","journal-title":"Math Program"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0391-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0391-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0391-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T16:21:16Z","timestamp":1594138876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0391-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,15]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["391"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0391-8","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,15]]}}}