{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T07:05:54Z","timestamp":1672988754593},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0305-0548(00)00066-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:00:41Z","timestamp":1027616441000},"page":"221-241","source":"Crossref","is-referenced-by-count":5,"title":["A branch-and-price algorithm for the Steiner tree packing problem"],"prefix":"10.1016","volume":"29","author":[{"given":"Gue-woong","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Kyungsik","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sungsoo","family":"Park","sequence":"additional","affiliation":[]},{"given":"Kyungchul","family":"Park","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00066-6_BIB1","series-title":"VLSI physical design automation","author":"Sait","year":"1995"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592086","article-title":"Packing Steiner trees: a cutting plane algorithm and computational results","volume":"72","author":"Gr\u00f6tschel","year":"1996","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB3","series-title":"Combinatorial algorithms for integrated circuit layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB4","unstructured":"Brady ML, Brown DJ. VLSI routing: four layers suffice. In: Preparata FP, editor. Advances in computing research, vol. 2: VLSI theory. London: JAI Press, 1984 p. 245\u201358."},{"key":"10.1016\/S0305-0548(00)00066-6_BIB5","unstructured":"Lipski W. On the structure of three-layer wireable layouts. In: Preparata FP, editor. Advances in computing research, vol. 2: VLSI theory. London: JAI Press, 1984. p. 231\u201344."},{"key":"10.1016\/S0305-0548(00)00066-6_BIB6","unstructured":"Burstein M. Channel routing. In: Ohtsuki T, editor. Advances in CAD for VLSI, vol. 4: layout design and verification. Amsterdam: North-Holland, 1986. p. 133\u201367."},{"key":"10.1016\/S0305-0548(00)00066-6_BIB7","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1972","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB8","doi-asserted-by":"crossref","unstructured":"Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, editors. Complexity of computer computations. New York: Plenum Press, 1972 p. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB9","unstructured":"Kramer MR, Leeuwen JV. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata FP, editor. Advances in computing research, vol. 2: VLSI theory. London: JAI Press, 1984. p. 129\u201346."},{"key":"10.1016\/S0305-0548(00)00066-6_BIB10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TCAD.1987.1270298","article-title":"Channel-routing problem in the knock-knee mode is NP-complete","volume":"CAD-6","author":"Sarrafzadeh","year":"1987","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02592085","article-title":"Packing Steiner trees: polyhedral investigations","volume":"72","author":"Gr\u00f6tschel","year":"1996","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1972","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB13","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB15","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","article-title":"A branch-and-price algorithm for the generalized assignment problem","volume":"45","author":"Savelsbergh","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB16","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","article-title":"An integer programming approach to the bandwidth packing problem","volume":"42","author":"Park","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TCAD.1983.1270040","article-title":"Hierarchical wire routing","volume":"CAD-2","author":"Burstein","year":"1983","journal-title":"IEEE Transactions on Computer-Aided-Design"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB18","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/43.3208","article-title":"BEAVER: A computational-geometry-based tool for switchbox routing","volume":"CAD-7","author":"Cohoon","year":"1988","journal-title":"IEEE Transactions on Computer-Aided-Design"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-9260(85)90029-X","article-title":"A greedy switchbox router","volume":"3","author":"Luk","year":"1985","journal-title":"Integration"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB20","series-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problems","volume":"22","author":"Hwang","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"The Steiner problem in networks: A survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(00)00066-6_BIB23","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","article-title":"Send-and-split method for minimum-concave-cost network flows","volume":"12","author":"Erickson","year":"1987","journal-title":"Mathematics of Operation Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000666?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000666?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T13:47:02Z","timestamp":1578836822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0305054800000666"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00066-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}