{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:06:18Z","timestamp":1777597578189,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10589-018-00055-9","type":"journal-article","created":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T07:12:14Z","timestamp":1546413134000},"page":"589-608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An algorithm for binary linear chance-constrained problems using IIS"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0418-5682","authenticated-orcid":false,"given":"Gianpiero","family":"Canessa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian A.","family":"Gallego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lewis","family":"Ntaimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernardo K.","family":"Pagnoncelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"issue":"3","key":"55_CR1","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1016\/j.ejor.2005.10.021","volume":"177","author":"FB Abdelaziz","year":"2007","unstructured":"Abdelaziz, F.B., Aouni, B., El Fayedh, R.: Multi-objective stochastic programming for portfolio selection. Eur. J. Oper. Res. 177(3), 1811\u20131823 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"55_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-016-0979-5","volume":"157","author":"A Abdi","year":"2016","unstructured":"Abdi, A., Fukasawa, R.: On the mixing set with a knapsack constraint. Math. Program. 157(1), 191\u2013217 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"55_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/opre.1120.1135","volume":"61","author":"S Ahmed","year":"2013","unstructured":"Ahmed, S., Papageorgiou, D.J.: Probabilistic set covering with correlations. Oper. Res. 61(2), 438\u2013452 (2013)","journal-title":"Oper. Res."},{"issue":"1","key":"55_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"55_CR5","doi-asserted-by":"publisher","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(6), 956\u2013967 (2002)","journal-title":"Oper. Res."},{"issue":"3","key":"55_CR6","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/07069821X","volume":"19","author":"MC Campi","year":"2008","unstructured":"Campi, M.C., Garatti, S.: The exact feasibility of randomized solutions of uncertain convex programs. SIAM J. Optimiz. 19(3), 1211\u20131230 (2008)","journal-title":"SIAM J. Optimiz."},{"issue":"2","key":"55_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.arcontrol.2009.07.001","volume":"33","author":"MC Campi","year":"2009","unstructured":"Campi, M.C., Garatti, S., Prandini, M.: The scenario approach for systems and control design. Annu. Rev. Control 33(2), 149\u2013157 (2009)","journal-title":"Annu. Rev. Control"},{"issue":"3","key":"55_CR8","doi-asserted-by":"publisher","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."},{"key":"55_CR9","volume-title":"Feasibility and infeasibility in optimization: algorithms and computational methods","author":"JW Chinneck","year":"2007","unstructured":"Chinneck, J.W.: Feasibility and infeasibility in optimization: algorithms and computational methods, vol. 118. Springer, Berlin (2007)"},{"issue":"1","key":"55_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/PL00011393","volume":"89","author":"D Dentcheva","year":"2000","unstructured":"Dentcheva, D., Pr\u00e9kopa, A., Ruszczynski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89(1), 55\u201377 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"55_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/ijoc.2.1.61","volume":"2","author":"J Gleeson","year":"1990","unstructured":"Gleeson, J., Ryan, J.: Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1), 61\u201363 (1990)","journal-title":"ORSA J. Comput."},{"issue":"1\u20132","key":"55_CR12","doi-asserted-by":"publisher","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":"6","key":"55_CR13","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/03052150310001614837","volume":"35","author":"M Kumral","year":"2003","unstructured":"Kumral, M.: Application of chance-constrained programming based on multi-objective simulated annealing to solve a mineral blending problem. Eng. Optimiz. 35(6), 661\u2013673 (2003)","journal-title":"Eng. Optimiz."},{"issue":"2","key":"55_CR14","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ejor.2010.05.025","volume":"207","author":"M Lejeune","year":"2010","unstructured":"Lejeune, M., Noyan, N.: Mathematical programming approaches for generating p-efficient points. Eur. J. Oper. Res. 207(2), 590\u2013600 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"55_CR15","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1287\/opre.1120.1120","volume":"60","author":"MA Lejeune","year":"2012","unstructured":"Lejeune, M.A.: Pattern-based modeling and solution of probabilistically constrained optimization problems. Oper. Res. 60(6), 1356\u20131372 (2012)","journal-title":"Oper. Res."},{"issue":"2","key":"55_CR16","doi-asserted-by":"publisher","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. Optimiz. 19(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optimiz."},{"issue":"2","key":"55_CR17","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"B Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optimiz. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optimiz. Theory Appl."},{"issue":"6","key":"55_CR18","first-page":"441","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. Z. Oper. Res. 34(6), 441\u2013461 (1990)","journal-title":"Z. Oper. Res."},{"issue":"1","key":"55_CR19","doi-asserted-by":"publisher","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."},{"issue":"4","key":"55_CR20","doi-asserted-by":"publisher","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":"1","key":"55_CR21","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.04.019","volume":"207","author":"MW Tanner","year":"2010","unstructured":"Tanner, M.W., Ntaimo, L.: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207(1), 290\u2013296 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"55_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1017\/S1068280500000411","volume":"23","author":"M Zhu","year":"1994","unstructured":"Zhu, M., Taylor, D.B., Sarin, S.C., Kramer, R., et al.: Chance constrained programming models for risk-based economic and policy analysis of soil conservation. Agric. Resour. Econ. Rev. 23(1), 58\u201365 (1994)","journal-title":"Agric. Resour. Econ. Rev."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-00055-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-00055-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-00055-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T19:44:03Z","timestamp":1577907843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-00055-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["55"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-00055-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"8 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}