{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T13:35:16Z","timestamp":1786109716789,"version":"3.56.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["1845980"],"award-info":[{"award-number":["1845980"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10107-022-01788-6","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T11:03:04Z","timestamp":1647860584000},"page":"621-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Chance-constrained set covering with Wasserstein ambiguity"],"prefix":"10.1007","volume":"198","author":[{"given":"Haoming","family":"Shen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3941-5057","authenticated-orcid":false,"given":"Ruiwei","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"issue":"1\u20132","key":"1788_CR1","first-page":"149","volume":"128","author":"S Ahmed","year":"2009","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128(1\u20132), 149\u2013169 (2009)","journal-title":"Math. Program."},{"key":"1788_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, S., Papageorgiou, D.J.: Probabilistic set covering with correlations. In: Operations Research 61.2, pp. 438\u2013452 (2013)","DOI":"10.1287\/opre.1120.1135"},{"issue":"5","key":"1788_CR3","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.orl.2008.04.006","volume":"36","author":"A Atamt\u00fcrk","year":"2008","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5), 618\u2013622 (2008)","journal-title":"Oper. Res. Lett."},{"key":"1788_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization, vol. 28. Princeton University Press, Princeton (2009)"},{"issue":"1","key":"1788_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10479-009-0670-9","volume":"177","author":"P Beraldi","year":"2009","unstructured":"Beraldi, P., Bruni, M.E.: An exact approach for solving integer problems under probabilistic constraints with random technology matrix. Ann. Oper. Res. 177(1), 127\u2013137 (2009)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"1788_CR6","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., Ruszczynski, A.: The probabilistic set-covering problem. Oper. Res. 50(6), 956\u2013967 (2002)","journal-title":"Oper. Res."},{"issue":"2","key":"1788_CR7","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1287\/moor.2018.0936","volume":"44","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Murthy, K.R.A.: Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2), 565\u2013600 (2019)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1788_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/opre.45.2.295","volume":"45","author":"J Bramel","year":"1997","unstructured":"Bramel, J., Simchi-Levi, D.: On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Oper. Res. 45(2), 295\u2013301 (1997)","journal-title":"Oper. Res."},{"issue":"1","key":"1788_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-006-9084-x","volume":"130","author":"GC Calafiore","year":"2006","unstructured":"Calafiore, G.C., El Ghaoui, L.: On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1), 1\u201322 (2006)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1788_CR10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2004","unstructured":"Calafiore, G., Campi, M.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102(1), 25\u201346 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"1788_CR11","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.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4(3), 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"issue":"1","key":"1788_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.3141\/1882-12","volume":"1882","author":"A Chen","year":"2004","unstructured":"Chen, A., Yang, C.: Stochastic transportation network design problem with spatial equity constraint. Transp. Res. Rec. 1882(1), 97\u2013104 (2004)","journal-title":"Transp. Res. Rec."},{"key":"1788_CR13","unstructured":"Chen, Z., Kuhn, D., Wiesemann, W.: Data-Driven Chance Constrained Programs Over Wasserstein Balls. arXiv:1809.00210 (2018)"},{"issue":"5","key":"1788_CR14","doi-asserted-by":"crossref","first-page":"4924","DOI":"10.1109\/TPWRS.2018.2807623","volume":"33","author":"C Duan","year":"2018","unstructured":"Duan, C., Fang, W., Jiang, L., Yao, L., Liu, J.: distributionally robust chance-constrained approximate ac-opf with wasserstein metric. IEEE Trans. Power Syst. 33(5), 4924\u20134936 (2018)","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"1788_CR15","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","volume":"51","author":"L El Ghaoui","year":"2003","unstructured":"El Ghaoui, L., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach. Oper. Res. 51(4), 543\u2013556 (2003)","journal-title":"Oper. Res."},{"issue":"3","key":"1788_CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s12532-012-0039-y","volume":"4","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3), 239\u2013273 (2012)","journal-title":"Math. Program. Comput."},{"issue":"3\u20134","key":"1788_CR17","first-page":"707","volume":"162","author":"N Fournier","year":"2014","unstructured":"Fournier, N., Guillin, A.: On the rate of convergence in Wasserstein distance of the empirical measure. Probab. Theory Relat. Fields 162(3\u20134), 707\u2013738 (2014)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"3","key":"1788_CR18","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1111\/j.1751-5823.2002.tb00178.x","volume":"70","author":"AL Gibbs","year":"2002","unstructured":"Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. Int. Stat. Rev. 70(3), 419\u2013435 (2002)","journal-title":"Int. Stat. Rev."},{"issue":"1","key":"1788_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Sequence independent lifting in mixed integer programming. J. Combin. Optim. 4(1), 109\u2013129 (2000)","journal-title":"J. Combin. Optim."},{"issue":"2","key":"1788_CR20","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(82)90159-X","volume":"10","author":"G Gunawardane","year":"1982","unstructured":"Gunawardane, G.: Dynamic versions of set covering type public facility location problems. Eur. J. Oper. Res. 10(2), 190\u2013195 (1982)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1788_CR21","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(3), 429\u2013457 (2001)","journal-title":"Math. Program."},{"issue":"1","key":"1788_CR22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10107-015-0896-z","volume":"151","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G.A., Roitch, V., Kuhn, D., Wiesemann, W.: A Distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Program. 151(1), 35\u201362 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1788_CR23","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/opre.2016.1583","volume":"65","author":"GA Hanasusanto","year":"2017","unstructured":"Hanasusanto, G.A., Roitch, V., Kuhn, D., Wiesemann, W.: Ambiguous joint chance constraints under mean and dispersion information. Oper. Res. 65(3), 751\u2013767 (2017)","journal-title":"Oper. Res."},{"key":"1788_CR24","doi-asserted-by":"crossref","unstructured":"Ho-Nguyen, N., K\u0131l\u0131n\u00e7-Karzan, F., K\u00fc\u00e7\u00fckyavuz, S., Lee, D.: Distributionally Robust Chance- Constrained Programs With Right-Hand Side Uncertainty Under Wasserstein Ambiguity. Math. Program. Forthcoming (2021)","DOI":"10.1287\/ijoo.2022.0083"},{"key":"1788_CR25","doi-asserted-by":"crossref","unstructured":"Ho-Nguyen, N., K\u0131l\u0131n\u00e7-Karzan, F., K\u00fc\u00e7\u00fckyavuz, S., Lee, D.: Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty under Wasserstein Ambiguity. arXiv:2007.06750 (2020)","DOI":"10.1007\/s10107-020-01605-y"},{"key":"1788_CR26","unstructured":"Hsiung, K.-L., Kim, S.-J., Boyd, S.: Power control in lognormal fading wireless channels with uptime probability specifications via robust geometric programming. In: Proceedings of the 2005, American Control Conference, 2005, pp. 3955\u20133959. IEEE (2005)"},{"key":"1788_CR27","doi-asserted-by":"crossref","unstructured":"Ji, R., Lejeune, M.: Data-driven distributionally robust chance-constrained optimization with Wasserstein metric. SSRN Electron. J. (2018)","DOI":"10.2139\/ssrn.3201356"},{"issue":"1\u20132","key":"1788_CR28","first-page":"291","volume":"158","author":"R Jiang","year":"2015","unstructured":"Jiang, R., Guan, Y.: Data-driven chance constrained stochastic program. Math. Program. 158(1\u20132), 291\u2013327 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1788_CR29","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(1\u20132), 31\u201356 (2012)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1788_CR30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10107-017-1212-x","volume":"173","author":"B Li","year":"2019","unstructured":"Li, B., Jiang, R., Mathieu, J.L.: Ambiguous risk constraints with moment and unimodality information. Math. Program. 173(1\u20132), 151\u2013192 (2019)","journal-title":"Math. Program."},{"key":"1788_CR31","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Mathematical Programming The State of the Art, pp. 235\u2013257 (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"issue":"1\u20132","key":"1788_CR32","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2014","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146(1\u20132), 219\u2013244 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1788_CR33","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(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1788_CR34","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1287\/opre.13.6.930","volume":"13","author":"BL Miller","year":"1965","unstructured":"Miller, B.L., Wagner, H.M.: Chance constrained programming with joint constraints. Oper. Res. 13(6), 930\u2013945 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"1788_CR35","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s11067-006-7684-5","volume":"6","author":"PA Miranda","year":"2006","unstructured":"Miranda, P.A., Garrido, R.A.: A Simultaneous inventory control and facility location model with stochastic capacity constraints. Netw. Spat. Econ. 6(1), 39\u201353 (2006)","journal-title":"Netw. Spat. Econ."},{"issue":"1","key":"1788_CR36","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"P Mohajerin Esfahani","year":"2018","unstructured":"Mohajerin Esfahani, P., Kuhn, D.: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171(1), 115\u2013166 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"1788_CR37","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2007","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17(4), 969\u2013996 (2007)","journal-title":"SIAM J. Optim."},{"key":"1788_CR38","doi-asserted-by":"crossref","unstructured":"Pr\u00e9kopa, A.: On probabilistic constrained programming. In: Proceedings of the Princeton Symposium on Mathematical Programming. Vol. 113, p. 138. Princeton (1970)","DOI":"10.1515\/9781400869930-009"},{"key":"1788_CR39","doi-asserted-by":"crossref","unstructured":"Pr\u00e9kopa, A.: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. In: ZOR Zeitschrift f\u00fcr Operations Research Methods and Models of Operations Research, Vol. 34.6, pp. 441\u2013461 (1990)","DOI":"10.1007\/BF01421551"},{"issue":"4","key":"1788_CR40","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.trb.2009.08.003","volume":"44","author":"CG Rawls","year":"2010","unstructured":"Rawls, C.G., Turnquist, M.A.: Pre-positioning of emergency supplies for disaster response. Transp. Res. Part B Methodol. 44(4), 521\u2013534 (2010)","journal-title":"Transp. Res. Part B Methodol."},{"key":"1788_CR41","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk (1999)","DOI":"10.21314\/JOR.2000.038"},{"issue":"1","key":"1788_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0224-y","volume":"121","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Goyal, V., Lejeune, M.A.: MIP reformulations of the probabilistic set covering problem. Math. Program. 121(1), 1\u201331 (2010)","journal-title":"Math. Program."},{"key":"1788_CR43","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Berlin (2003)"},{"key":"1788_CR44","unstructured":"Shehadeh, K.S., Tucker, E.L.: A Distributionally Robust Optimization Approach for Location and Inventory Prepositioning of Disaster Relief Supplies. arXiv:2012.05387 [math.OC] (2020)"},{"key":"1788_CR45","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0191-2607(88)90022-2","volume":"2","author":"BM Smith","year":"1988","unstructured":"Smith, B.M., Wren, A.: A bus crew scheduling system using a set covering formulation. Transp. Res. Part A General 2, 97\u2013108 (1988)","journal-title":"Transp. Res. Part A General"},{"issue":"4","key":"1788_CR46","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s12532-013-0058-3","volume":"5","author":"Y Song","year":"2013","unstructured":"Song, Y., Luedtke, J.R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Program. Comput. 5(4), 397\u2013432 (2013)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1788_CR47","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/ijoc.2014.0595","volume":"26","author":"Y Song","year":"2014","unstructured":"Song, Y., Luedtke, J.R., K\u00fc\u00e7\u00fckyavuz, S.: Chance-constrained binary packing problems. INFORMS J. Comput. 26(4), 735\u2013747 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1788_CR48","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1287\/opre.26.2.305","volume":"26","author":"DM Topkis","year":"1978","unstructured":"Topkis, D.M.: Minimizing a submodular function on a lattice. Oper. Res. 26(2), 305\u2013321 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"1788_CR49","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/S0036144504440543","volume":"49","author":"L Vandenberghe","year":"2007","unstructured":"Vandenberghe, L., Boyd, S., Comanor, K.: Generalized Chebyshev bounds via semidefinite programming. SIAM Rev. 49(1), 52\u201364 (2007)","journal-title":"SIAM Rev."},{"issue":"1","key":"1788_CR50","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L., Jr.: A set covering approach to metallurgical grade assignment. Eur. J. Oper. Res. 38(1), 27\u201334 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"1788_CR51","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1080\/24725854.2020.1725692","volume":"52","author":"GA Velasquez","year":"2020","unstructured":"Velasquez, G.A., Mayorga, M.E., \u00d6zalt\u0131n, O.Y.: Prepositioning disaster relief supplies using robust optimization. IISE Trans. 52(10), 1122\u20131140 (2020). https:\/\/doi.org\/10.1080\/24725854.2020.1725692","journal-title":"IISE Trans."},{"key":"1788_CR52","unstructured":"Wang, S., Li, J., Mehrotra, S.: A solution approach to distributionally robust chance- constrained assignment. Optim. Online Preprints (2019)"},{"key":"1788_CR53","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"2014","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley, New York (2014)"},{"issue":"1","key":"1788_CR54","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1137\/17M1141576","volume":"29","author":"H Wu","year":"2019","unstructured":"Wu, H., K\u00fc\u00e7\u00fckyavuz, S.: Probabilistic partial set covering with an oracle for chance constraints. SIAM J. Optim. 29(1), 690\u2013718 (2019)","journal-title":"SIAM J. Optim."},{"key":"1788_CR55","doi-asserted-by":"crossref","unstructured":"Xie, W.: On distributionally robust chance constrained programs with wasserstein distance. In: Mathematical Programming (2019)","DOI":"10.1007\/s10107-019-01445-5"},{"key":"1788_CR56","doi-asserted-by":"crossref","unstructured":"Xie, W., Ahmed, S.: Bicriteria approximation of chance-constrained covering problems. Oper. Res. (2020)","DOI":"10.1287\/opre.2019.1866"},{"key":"1788_CR57","doi-asserted-by":"crossref","unstructured":"Xie, W., Ahmed, S.: On deterministic reformulations of distributionally robust joint chance constrained optimization problems. SIAM J. Optim. 28 (2016)","DOI":"10.1137\/16M1094725"},{"issue":"3","key":"1788_CR58","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.1120.1054","volume":"60","author":"H Xu","year":"2012","unstructured":"Xu, H., Caramanis, C., Mannor, S.: Optimization under probabilistic envelope constraints. Oper. Res. 60(3), 682\u2013699 (2012)","journal-title":"Oper. Res."},{"key":"1788_CR59","unstructured":"Yang, I.: Wasserstein Distributionally Robust Stochastic Control: A Data-Driven Approach (2018). arXiv: 1812.09808 [math.OC]"},{"issue":"2","key":"1788_CR60","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/nav.10093","volume":"52","author":"J Yang","year":"2005","unstructured":"Yang, J., Leung, J.Y.-T.: A generalization of the weighted set covering problem. Naval Res. Logist 52(2), 142\u2013149 (2005)","journal-title":"Naval Res. Logist"},{"issue":"1\u20132","key":"1788_CR61","first-page":"231","volume":"155","author":"W Yang","year":"2014","unstructured":"Yang, W., Xu, H.: Distributionally robust chance constraints for non-linear uncertainties. Math. Program. 155(1\u20132), 231\u2013265 (2014)","journal-title":"Math. Program."},{"key":"1788_CR62","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1049\/iet-gtd.2009.0374","volume":"4","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Li, P.: Probabilistic analysis for optimal power flow under uncertainty. IET Gener. Transm. Distrib. 4, 553\u2013561 (2010)","journal-title":"IET Gener. Transm. Distrib."},{"issue":"1\u20132","key":"1788_CR63","first-page":"167","volume":"137","author":"S Zymler","year":"2011","unstructured":"Zymler, S., Kuhn, D., Rustem, B.: Distributionally robust joint chance constraints with second-order moment information. Math. Program. 137(1\u20132), 167\u2013198 (2011)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01788-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01788-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01788-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T22:19:52Z","timestamp":1677017992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01788-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1788"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01788-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"5 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}