{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:55:16Z","timestamp":1771235716835,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1007\/bf01581104","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:36:37Z","timestamp":1114666597000},"page":"177-199","source":"Crossref","is-referenced-by-count":91,"title":["Minimum cost capacity installation for multicommodity network flows"],"prefix":"10.1007","volume":"81","author":[{"given":"Daniel","family":"Bienstock","sequence":"first","affiliation":[]},{"given":"Sunil","family":"Chopra","sequence":"additional","affiliation":[]},{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[]},{"given":"Chih-Yang","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"F. Barahona, Network design using cut inequalities, SIAM Journal on Optimization 6 (1996).","DOI":"10.1137\/S1052623494279134"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"D. Bienstock, O. G\u00fcnl\u00fck, Capacitated network design \u2014 polyhedral structure and computation, INFORMS Journal on Computing (1996) 243\u2013259.","DOI":"10.1287\/ijoc.8.3.243"},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K. Hoffman","year":"1991","unstructured":"K. Hoffman, M. Padberg, Improving LP-representation of zero\u2013one linear programs for branch-and-cut, ORSA Journal on Computing 3 (2) (1991) 121\u2013134.","journal-title":"ORSA Journal on Computing"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"K. Onaga, O. Kakusho, On feasibility conditions of multicommodity flows in networks, IEEE Transactions in Circuit Theory, CT-18 (4) 425\u2013429.","DOI":"10.1109\/TCT.1971.1083312"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"R.L. Rardin, L.A. Wolsey, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network network flow problems, European Journal of Operational Research (November 1993).","DOI":"10.1016\/0377-2217(93)90263-M"},{"key":"CR7","first-page":"213","volume":"68","author":"D. Bienstock","year":"1995","unstructured":"D. Bienstock, O. G\u00fcnl\u00fck, Computational experience with a difficult mixed-integer multicommodity flow problem, Mathematical Programming 68 (1995) 213\u2013238.","journal-title":"Mathematical Programming"},{"key":"CR8","first-page":"371","volume-title":"Handbooks in OR & MS, vol. 1","author":"W.R. Pulleyblank","year":"1989","unstructured":"W.R. Pulleyblank, Polyhedral combinatorics, in: G.L. Nemhauser et al. (Eds.), Handbooks in OR & MS, vol. 1, North-Holland, Amsterdam, 1989, pp. 371\u2013446."},{"key":"CR9","volume-title":"Minimum cost capacity installation for multicommodity network flows, CORE Discussion Paper","author":"D. Bienstock","year":"1995","unstructured":"D. Bienstock, S. Chopra, O. G\u00fcnl\u00fck, C.-Y. Tsai, Minimum cost capacity installation for multicommodity network flows, CORE Discussion Paper, Universit\u00e9 Catholique de Louvain, Belgium (1995)."},{"issue":"6","key":"CR10","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K. Hoffman","year":"1993","unstructured":"K. Hoffman, M. Padberg, Solving airline crew scheduling problems by branch-and-cut, Management Science 39 (6) (1993) 657\u2013682.","journal-title":"Management Science"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padbergl","year":"1991","unstructured":"M. Padbergl, G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33 (1991) 60\u2013100.","journal-title":"SIAM Review"},{"issue":"1","key":"CR12","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T. Magnanti","year":"1995","unstructured":"T. Magnanti, P. Mirchandani, R. Vachani, Modeling and solving the two facility capacitated network loading problem, Operations Research 43 (1) (1995) 142\u2013157.","journal-title":"Operations Research"},{"key":"CR13","unstructured":"F. Barahona, personal communication."},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"M. Stoer, G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik 68 (1) (1994) 149\u2013167.","journal-title":"Numerische Mathematik"},{"key":"CR15","unstructured":"M. Stoer, private communication."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581104.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581104\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:15Z","timestamp":1556881935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["BF01581104"],"URL":"https:\/\/doi.org\/10.1007\/bf01581104","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}