{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:25Z","timestamp":1759847305836},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02109861","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T09:51:41Z","timestamp":1126605101000},"page":"261-274","source":"Crossref","is-referenced-by-count":28,"title":["Strong formulations and cutting planes for designing digital data service networks"],"prefix":"10.1007","volume":"2","author":[{"given":"Youngho","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuping","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02109861_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, An integer linear programming approach to the Steiner problem in graphs, Networks 10(1980)167\u2013178.","journal-title":"Networks"},{"key":"BF02109861_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","volume":"14","author":"J.E. Beasley","year":"1984","unstructured":"J.E. Beasley, An algorithm for the Steiner problem in graphs, Networks 14(1984)147\u2013159.","journal-title":"Networks"},{"key":"BF02109861_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"J.E. Beasley, An SST-based algorithm for the Steiner problem on graphs, Networks 19(1989)1\u201316.","journal-title":"Networks"},{"key":"BF02109861_CR4","unstructured":"S. Chopra and E. Gorres, On the node weighted Steiner tree problem, Working Paper, Northwestern University (1990)."},{"key":"BF02109861_CR5","unstructured":"S. Chopra and M.R. Rao, On the Steiner tree problem, I and II, Working Paper, New York University (1989)."},{"key":"BF02109861_CR6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.4.3.320","volume":"4","author":"S. Chopra","year":"1992","unstructured":"S. Chopra, E. Gorres and M.R. Rao, Solving the Steiner tree problem on a graph using branch and cut, ORSA J. Comput. 4(1992)320\u2013336.","journal-title":"ORSA J. Comput."},{"key":"BF02109861_CR7","unstructured":"CPLEX Optimization, Inc., Using the CPLEX callable library and CPLEX mixed integer library (1992)."},{"key":"BF02109861_CR8","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson and M.W. Padberg, Solving large-scale zero-one linear programming problems, Oper. Res. 31(1983)803\u2013834.","journal-title":"Oper. Res."},{"key":"BF02109861_CR9","unstructured":"M. Fischetti, Facets of two Steiner arborescence polyhedra, Technical Report No. OR-89-4, University of Bologna (1989)."},{"key":"BF02109861_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S.L. Hakimi","year":"1971","unstructured":"S.L. Hakimi, Steiner's problem in graphs and its implications, Networks 1(1971)113\u2013133.","journal-title":"Networks"},{"key":"BF02109861_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K.L. Hoffman","year":"1991","unstructured":"K.L. Hoffman and M.W. Padberg, Improving LP-representations of zero-one linear programs for branch- and-cut, ORSA J. Comput. 3(1991)121\u2013134.","journal-title":"ORSA J. Comput."},{"key":"BF02109861_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"F.K. Hwang and D.S. Richards, Steiner tree problems, Networks 22(1992)55\u201389.","journal-title":"Networks"},{"key":"BF02109861_CR13","volume-title":"Least cost circuit layout for telecommunication networks","author":"F. Glover","year":"1992","unstructured":"F. Glover, Least cost circuit layout for telecommunication networks, University of Colorado, Boulder, CO (1992)."},{"key":"BF02109861_CR14","first-page":"185","volume":"31","author":"N. Maculan","year":"1987","unstructured":"N. Maculan, The Steiner problem in graphs, Ann. Discr. Math. 31(1987)185\u2013222.","journal-title":"Ann. Discr. Math."},{"key":"BF02109861_CR15","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"K.R. Martin","year":"1987","unstructured":"K.R. Martin, Generating alternative mixed-integer programming models using variable redefinition, Oper. Res. 35(1987)820\u2013831.","journal-title":"Oper. Res."},{"key":"BF02109861_CR16","volume-title":"Mathematical model for least cost networks with switch hierarchies","author":"S. McCrady","year":"1992","unstructured":"S. McCrady, Mathematical model for least cost networks with switch hierarchies, US West Advanced Technologies, Boulder, CO (1992)."},{"key":"BF02109861_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"M.W. Padberg and G. Rinaldi, A branch- and cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev. 33(1991)60\u2013100.","journal-title":"SIAM Rev."},{"key":"BF02109861_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T.J. Roy Van","year":"1987","unstructured":"T.J. Van Roy and L.A. Wolsey, Solving mixed integer programs by automatic reformulation, Oper. Res. 35(1987)45\u201357.","journal-title":"Oper. Res."},{"key":"BF02109861_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A. Segev","year":"1987","unstructured":"A. Segev, The node-weighted Steiner tree problem, Networks 17(1987)1\u201317.","journal-title":"Networks"},{"key":"BF02109861_CR20","volume-title":"Research Report","author":"H.D. Sherali","year":"1992","unstructured":"H.D. Sherali, Tight linear programming representations: A key to solving nonconvex programming problems, Research Report, Department of Industrial and Systems Engineering, Virginia Polytechic Institute and State University, Blacksburg, VA (1992)."},{"key":"BF02109861_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230120309","volume":"12","author":"M.L. Shore","year":"1982","unstructured":"M.L. Shore, L.R. Foulds and P.B. Gibbons, An algorithm for the Steiner problem in graphs, Networks 12(1982)323\u2013333.","journal-title":"Networks"},{"key":"BF02109861_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, Steiner problem in networks: A survey, Networks 17(1987)129\u2013167.","journal-title":"Networks"},{"key":"BF02109861_CR23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589102","volume":"45","author":"L.A. Wolsey","year":"1989","unstructured":"L.A. Wolsey, Strong formulations for mixed integer programming: A survey, Math. Progr. 45(1989)173\u2013191.","journal-title":"Math. Progr."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02109861.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02109861\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02109861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T15:15:36Z","timestamp":1557846936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02109861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02109861"],"URL":"https:\/\/doi.org\/10.1007\/bf02109861","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}