{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T23:04:06Z","timestamp":1696979046147},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3546,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0166-218x(03)00436-0","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"103-121","source":"Crossref","is-referenced-by-count":4,"title":["Bidirected and unidirected capacity installation in telecommunication networks"],"prefix":"10.1016","volume":"133","author":[{"given":"Stan P.M","family":"van Hoesel","sequence":"first","affiliation":[]},{"given":"Arie M.C.A","family":"Koster","sequence":"additional","affiliation":[]},{"given":"Robert L.M.J","family":"van de Leensel","sequence":"additional","affiliation":[]},{"given":"Martin W.P","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0166-218X(03)00436-0_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100269","article-title":"On splittable and unsplittable flow capacitated network design arc-set polyhedra","volume":"92","author":"Atamturk","year":"2002","journal-title":"Math. Programming Ser. A"},{"key":"10.1016\/S0166-218X(03)00436-0_BIB2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","article-title":"Facets of the knapsack polytope","volume":"8","author":"Balas","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00436-0_BIB3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","article-title":"Network design using cut inequalities","volume":"6","author":"Barahona","year":"1996","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/S0166-218X(03)00436-0_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0167-6377(99)00071-1","article-title":"On the k-cut problem","volume":"26","author":"Barahona","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB5","doi-asserted-by":"crossref","unstructured":"D. Bienstock, private communication, 1998.","DOI":"10.1016\/S0025-5610(97)00079-8"},{"key":"10.1016\/S0166-218X(03)00436-0_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01581104","article-title":"Minimum cost capacity installation for multicommodity network flows","volume":"81","author":"Bienstock","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00436-0_BIB7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","article-title":"Capacitated network design\u2014polyhedral structure and computation","volume":"8","author":"Bienstock","year":"1996","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB8","unstructured":"B. Brockm\u00fcller, O. G\u00fcnl\u00fck, L.A. Wolsey, Designing private line networks\u2014polyhedral analysis and computation, Discussion Paper 9647, Center for Operations Research and Econometrics, October 1996."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB9","unstructured":"B. Brockm\u00fcller, O. G\u00fcnl\u00fck, L.A. Wolsey, Designing private line networks\u2014polyhedral analysis and computation, Discussion Paper 9647 revised, Center for Operations Research and Econometrics, March 1998."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB10","unstructured":"CPLEX division of ILOG. CPLEX callable library, version 6.5, 1999."},{"issue":"3","key":"10.1016\/S0166-218X(03)00436-0_BIB11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","article-title":"Backbone network design tools with economic tradeoffs","volume":"2","author":"Gavish","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB12","unstructured":"C.P.M. van Hoesel, A.M.C.A. Koster, R.L.M.J. van de Leensel, M.W.P. Savelsbergh, Polyhedral results for the edge capacity polytope, Technical Report ZIB 00-22, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Berlin, Germany, 2000. Available at http:\/\/www.zib.de\/koster\/."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB13","doi-asserted-by":"crossref","unstructured":"R.L.M.J. van de Leensel, Models and algorithms for telecommunication network design, Ph.D. Thesis, Maastricht University, 1999.","DOI":"10.1007\/s101070050084"},{"key":"10.1016\/S0166-218X(03)00436-0_BIB14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01580612","article-title":"The convex hull of two-core capacitated network design problems","volume":"60","author":"Magnanti","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00436-0_BIB15","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","article-title":"Modeling and solving the two-facility capacitated network loading problem","volume":"43","author":"Magnanti","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB16","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","article-title":"A note on zero-one programming","volume":"23","author":"Padberg","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB17","unstructured":"S. Thienel, ABACUS: A Branch And CUt System, version 2.2, 1998."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB18","unstructured":"R. Wess\u00e4ly, Dimensioning Survivable Capacitated NETworks, Ph.D. Thesis, Technische Universit\u00e4t Berlin, 2000."},{"key":"10.1016\/S0166-218X(03)00436-0_BIB19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Faces of linear inequalities in 0\u20131 variables","volume":"8","author":"Wolsey","year":"1975","journal-title":"Math. Programming"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03004360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:27:15Z","timestamp":1551047235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03004360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0166218X03004360"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00436-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}