{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:24:17Z","timestamp":1779323057887,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T00:00:00Z","timestamp":1376006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s12532-013-0058-3","type":"journal-article","created":{"date-parts":[[2013,8,8]],"date-time":"2013-08-08T10:57:13Z","timestamp":1375959433000},"page":"397-432","source":"Crossref","is-referenced-by-count":28,"title":["Branch-and-cut approaches for chance-constrained formulations of reliable network design problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Yongjia","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James R.","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,9]]},"reference":[{"key":"58_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"58_CR2","volume-title":"Network Flows","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, New Jersey (1993)"},{"key":"58_CR3","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/ijoc.1080.0266","volume":"20","author":"AK Andreas","year":"2008","unstructured":"Andreas, A.K., Smith, J.C.: Mathematical programming algorithms for two-path routing problems with reliability considerations. INFORMS J. Comput. 20, 553\u2013564 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"58_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding cuts in a branch and cut framework: a computational study with 0,1\/2-cuts. INFORMS J. Comput. 19(2), 229\u2013238 (2007)","journal-title":"INFORMS J. Comput."},{"key":"58_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y Aneja","year":"1980","unstructured":"Aneja, Y.: An integer linear programming approach to the steiner problem in graphs. Networks 10, 167\u2013178 (1980)","journal-title":"Networks"},{"key":"58_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s101070000154.","volume":"89","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G., Savelsbergh, M.: The mixed vertex packing problem. Math. Program. 89, 35\u201353 (2000)","journal-title":"Math. Program."},{"key":"58_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/moor.25.2.243.12223","volume":"25","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Barahona, F., Mahjoub, A.: Separation of partition inequalities. Math. Oper. Res. 25, 243\u2013254 (2000)","journal-title":"Math. Oper. Res."},{"key":"58_CR8","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"58_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10479-009-0670-9","volume":"177","author":"P Beraldi","year":"2010","unstructured":"Beraldi, P., Bruni, M.: An exact approach for solving integer problems under probabilistic constraints with random technology matrix. Ann. Oper. Res. 177, 127\u2013137 (2010)","journal-title":"Ann. Oper. Res."},{"key":"58_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1093\/imaman\/dpp005","volume":"21","author":"P Beraldi","year":"2010","unstructured":"Beraldi, P., Bruni, M.E., Guerriero, F.: Network reliablity design via joint probabilistic contraints. IMA J. Manag. Math. 21, 213\u2013226 (2010)","journal-title":"IMA J. Manag. Math."},{"key":"58_CR11","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1287\/opre.50.6.956.345","volume":"50","author":"P Beraldi","year":"2002","unstructured":"Beraldi, P., Ruszczy\u0144ski, A.: The probabilistic set-covering problem. Oper. Res. 50, 956\u2013967 (2002)","journal-title":"Oper. Res."},{"key":"58_CR12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2005","unstructured":"Calafiore, G., Campi, M.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102, 25\u201346 (2005)","journal-title":"Math. Program."},{"key":"58_CR13","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"G Calafiore","year":"2006","unstructured":"Calafiore, G., Campi, M.: The scenario approach to robust control design. IEEE Trans. Automat. Control 51, 742\u2013753 (2006)","journal-title":"IEEE Trans. Automat. Control"},{"key":"58_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10957-010-9754-6","volume":"148","author":"M Campi","year":"2011","unstructured":"Campi, M., Garatti, S.: A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality. J. Optim. Theory Appl. 148, 257\u2013280 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"58_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","volume":"4","author":"A Charnes","year":"1958","unstructured":"Charnes, A., Cooper, W., Symonds, G.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manage. Sci. 4, 235\u2013263 (1958)","journal-title":"Manage. Sci."},{"key":"58_CR16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/opre.11.1.18","volume":"11","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W.: Deterministic equivalents for optimizing and satisficing under chance constraints. Oper. Res. 11, 18\u201339 (1963)","journal-title":"Oper. Res."},{"key":"58_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0167-6377(89)90029-1","volume":"8","author":"S Chopra","year":"1989","unstructured":"Chopra, S.: On the spanning tree polyhedron. Oper. Res. Lett. 8, 25\u201329 (1989)","journal-title":"Oper. Res. Lett."},{"key":"58_CR18","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"K Cormican","year":"1998","unstructured":"Cormican, K., Morton, D., Wood, R.: Stochastic network interdiction. Oper. Res. 46, 184\u2013197 (1998)","journal-title":"Oper. Res."},{"key":"58_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/PL00011393","volume":"89","author":"D Dentcheva","year":"2000","unstructured":"Dentcheva, D., Pr\u00e9kopa, A., Ruszczy\u0144ski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55\u201377 (2000)","journal-title":"Math. Program."},{"key":"58_CR20","unstructured":"Fischetti, M., Monaci, M.: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3), 239\u2013273 (2012)"},{"key":"58_CR21","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1287\/opre.43.6.1012","volume":"43","author":"M Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C., Stoer, M.: Polyhedral and computational investigations for designing communication networks with high survivability requirements. Oper. Res. 43, 1012\u20131024 (1995)","journal-title":"Oper. Res."},{"key":"58_CR22","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90, 429\u2013457 (2001)","journal-title":"Math. Program."},{"key":"58_CR23","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J Hao","year":"1994","unstructured":"Hao, J., Orlin, J.: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17, 424\u2013446 (1994)","journal-title":"J. Algorithms"},{"key":"58_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132, 31\u201356 (2012)","journal-title":"Math. Program."},{"key":"58_CR25","unstructured":"LEMON\u2014Library for Efficient Modeling and Optimization in Networks. http:\/\/lemon.cs.elte.hu\/ (2009)"},{"key":"58_CR26","doi-asserted-by":"crossref","unstructured":"Luedtke, J.: An integer programming and decomposition approach to general chance-constrained mathematical programs. In: Eisenbrand, F., Shepherd, F. (eds.) IPCO 2010. Lecture Notes in Computer Science. Springer, Berlin, pp. 271\u2013284 (2010)","DOI":"10.1007\/978-3-642-13036-6_21"},{"key":"58_CR27","doi-asserted-by":"crossref","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. pp. 1\u201326. doi: 10.1007\/s10107-013-0684-6 (2013)","DOI":"10.1007\/s10107-013-0684-6"},{"key":"58_CR28","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19, 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"58_CR29","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"12","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.L.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 12, 247\u2013272 (2010)","journal-title":"Math. Program."},{"key":"58_CR30","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"TL Magnanti","year":"2005","unstructured":"Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45, 61\u201379 (2005)","journal-title":"Networks"},{"key":"58_CR31","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"58_CR32","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York (1988)","DOI":"10.1002\/9781118627372"},{"key":"58_CR33","first-page":"3","volume-title":"Probabilistic and Randomized Methods for Design Under Uncertainty","author":"A Nemirovski","year":"2005","unstructured":"Nemirovski, A., Shapiro, A.: Scenario approximation of chance constraints. In: Calafiore, G., Dabbene, F. (eds.) Probabilistic and Randomized Methods for Design Under Uncertainty, pp. 3\u201348. Springer, London (2005)"},{"key":"58_CR34","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17, 969\u2013996 (2006)","journal-title":"SIAM J. Optim."},{"key":"58_CR35","unstructured":"Orlowski, S., Wess\u00e4ly, R., Pioro, M., Tomaszewski, A.: Survivable network design data library (2012). http:\/\/sndlib.zib.de"},{"key":"58_CR36","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01421551","volume":"34","author":"A Pr\u00e9kopa","year":"1990","unstructured":"Pr\u00e9kopa, A.: Dual method for the solution of a one-stage stochastic programming problem with random rhs obeying a discrete probability distribution. ZOR Meth. Models Oper. Res. 34, 441\u2013461 (1990)","journal-title":"ZOR Meth. Models Oper. Res."},{"key":"58_CR37","first-page":"267","volume-title":"Stochastic Programming. Handbooks Operations Research and Management Science, vol. 10","author":"A Pr\u00e9kopa","year":"2003","unstructured":"Pr\u00e9kopa, A.: Probabilistic programming. In: Ruszczy\u0144ski, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks Operations Research and Management Science, vol. 10, pp. 267\u2013351. Elsevier, Amsterdam (2003)"},{"key":"58_CR38","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-002-0337-7","volume":"93","author":"A Ruszczy\u0144ski","year":"2002","unstructured":"Ruszczy\u0144ski, A.: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math. Program. 93, 195\u2013215 (2002)","journal-title":"Math. Program."},{"key":"58_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0224-y","volume":"121","author":"A Saxena","year":"2009","unstructured":"Saxena, A., Goyal, V., Lejeune, M.: MIP reformulations of the probabilistic set covering problem. Math. Program. 121, 1\u201331 (2009)","journal-title":"Math. Program."},{"key":"58_CR40","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"key":"58_CR41","doi-asserted-by":"crossref","unstructured":"Song, Y., Luedtke, J.: Supplement to \u2018branch-and-cut approaches for chance-constrained formulations of reliable network design problems\u2019. Tech. rep, UW-Madison (2012)","DOI":"10.1007\/s12532-013-0058-3"},{"key":"58_CR42","unstructured":"Sorokin, A., Boginski, V., Nahapetyan, A.G., Pardalos, P.M.: Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J. Comb. Optim. 25(1), 99\u2013122 (2013)"},{"key":"58_CR43","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2010.04.019","volume":"207","author":"M Tanner","year":"2010","unstructured":"Tanner, M., Ntaimo, L.: IIS branch-and-cut for joint chance-constrained programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207, 290\u2013296 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"58_CR44","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W Tutte","year":"1961","unstructured":"Tutte, W.: On the problem of decomposing a graph into $$n$$ n connected factors. J. Lond. Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0058-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-013-0058-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0058-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:56:26Z","timestamp":1563638186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-013-0058-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,9]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["58"],"URL":"https:\/\/doi.org\/10.1007\/s12532-013-0058-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,9]]}}}