{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T09:50:27Z","timestamp":1785750627300,"version":"3.56.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T00:00:00Z","timestamp":1213660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10107-008-0224-y","type":"journal-article","created":{"date-parts":[[2008,6,16]],"date-time":"2008-06-16T12:21:09Z","timestamp":1213618869000},"page":"1-31","source":"Crossref","is-referenced-by-count":50,"title":["MIP reformulations of the probabilistic set covering problem"],"prefix":"10.1007","volume":"121","author":[{"given":"Anureet","family":"Saxena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miguel A.","family":"Lejeune","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,6,17]]},"reference":[{"issue":"1-3","key":"224_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas E.: Disjunctive programming, properties of the convex hull of feasible points. Discret. Appl. Math. 89(1-3), 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"224_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E. Balas","year":"2008","unstructured":"Balas E., Saxena A.: Optimizing over the split closure. Math. Program. Ser. A 113(2), 219\u2013240 (2008)","journal-title":"Math. Program. Ser. A"},{"key":"224_CR3","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1287\/opre.28.5.1074","volume":"28","author":"J.J.III Bartholdi","year":"1980","unstructured":"Bartholdi J.J.III, Orlin J.B., Ratliff H.D.: Cyclic scheduling via integer programs with circular ones. Oper. Res. 28, 1074\u20131085 (1980)","journal-title":"Oper. Res."},{"key":"224_CR4","unstructured":"Beasley, J.E.: OR-Library. http:\/\/www.people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"224_CR5","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."},{"issue":"3","key":"224_CR6","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/1055678021000033937","volume":"17","author":"P. Beraldi","year":"2002","unstructured":"Beraldi P., Ruszczy\u0144ski A.: A branch and bound method for stochastic integer problems under probabilistic constraints. Optim. Methods Softw. 17(3), 359\u2013382 (2002)","journal-title":"Optim. Methods Softw."},{"key":"224_CR7","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, 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"key":"224_CR8","unstructured":"Christof, T., Lobel, A.: PORTA - POlyhedron Representation Transformation Algorithm. http:\/\/www.zib.de\/Optimization\/Software\/Porta\/"},{"key":"224_CR9","unstructured":"COIN: Computational infrastructure for operations research. http:\/\/www.coin-or.org"},{"key":"224_CR10","first-page":"249","volume":"71","author":"G. Cornuejols","year":"1995","unstructured":"Cornuejols G., Conforti M.: Balanced 0,1,-1 Matrices, bicoloring and total dual integrality. Math. Program. 71, 249\u2013258 (1995)","journal-title":"Math. Program."},{"key":"224_CR11","doi-asserted-by":"crossref","unstructured":"Cornuejols, G.: Combinatorial Optimization: Packing and Covering. Published by SIAM (2001) in the CBMS-NSF Regional Conference Series in Applied Mathematics CBMS 74 (2000)","DOI":"10.1137\/1.9780898717105"},{"key":"224_CR12","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."},{"issue":"1","key":"224_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"A. Lodi","year":"2007","unstructured":"Lodi A., Fischetti M.: Optimizing over the first Chv\u00e1tal closure. Math. Program. 110(1), 3\u201320 (2007)","journal-title":"Math. Program."},{"key":"224_CR14","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"Holmberg K., Ronnqvist M., Yuan D.: An exact algorithm for the capacited facility location 517 problems with single sourcing. Eur. J. Oper. Res. 113, 544\u2013559 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"224_CR15","volume-title":"Probabilistic Symmetries and Invariance Principles","author":"O. Kallenberg","year":"2005","unstructured":"Kallenberg O.: Probabilistic Symmetries and Invariance Principles. Springer, Heidelberg (2005)"},{"issue":"2","key":"224_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.1060.0356","volume":"55","author":"M.A. Lejeune","year":"2007","unstructured":"Lejeune M.A., Ruszczy\u0144ski A.: An efficient method trajectory method for probabilistic inventory-production-distribution problems. Oper. Res. 55(2), 378\u2013394 (2007)","journal-title":"Oper. Res."},{"key":"224_CR17","volume-title":"Strong MIP Formulations for Chance Constrained Linear Programs with Random Right-Hand Side","author":"J. Luedtke","year":"2006","unstructured":"Luedtke J., Ahmed S., Nemhauser G.: Strong MIP Formulations for Chance Constrained Linear Programs with Random Right-Hand Side. INFORMS Conference, Pittsburgh (2006)"},{"key":"224_CR18","first-page":"441","volume":"34","author":"A. Pr\u00e9kopa","year":"1990","unstructured":"Pr\u00e9kopa A.: Dual method for a one-stage stochastic programming with random rhs obeying a discrete probability distribution. Z. Oper. Res. 34, 441\u2013461 (1990)","journal-title":"Z. Oper. Res."},{"key":"224_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A. Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa A.: Stochastic Programming. Kluwer, Boston (1995)"},{"key":"224_CR20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0927-0507(03)10005-9","volume-title":"Stochastic Programming: Handbook in Operations Research and Management Science, vol. 10, Chap. 5","author":"A. Pr\u00e9kopa","year":"2003","unstructured":"Pr\u00e9kopa A.: Probabilistic programming models. In: Ruszczy\u0144ski, A., Shapiro, A. (eds) Stochastic Programming: Handbook in Operations Research and Management Science, vol. 10, Chap. 5, pp. 267\u2013351. Elsevier Science Ltd, Amsterdam (2003)"},{"key":"224_CR21","volume-title":"New Trends in Mathematical Programming","author":"A. Pr\u00e9kopa","year":"1998","unstructured":"Pr\u00e9kopa A., Vizvari B., Badics T.: Programming under probabilistic constraint with discrete random variable. In: Giannessi, F., Koml\u00f3si, S., Rapcs\u00e1k, T. (eds) New Trends in Mathematical Programming, MA, Boston (1998)"},{"key":"224_CR22","unstructured":"Saxena, A., Goyal, V., Lejeune, M.A.: MIP reformulations of the probabilistic set covering problem, Tepper Working Paper No. 2007-E3 (2007)"},{"issue":"2","key":"224_CR23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0167-6377(92)90037-4","volume":"11","author":"S. Sen","year":"1992","unstructured":"Sen S.: Relaxations for probabilistically constrained programs with discrete random variables. Oper. Res. Lett. 11(2), 81\u201386 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"224_CR24","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10107-005-0573-8","volume":"103","author":"C. Souza de","year":"2005","unstructured":"de Souza C., Balas E.: The vertex separator problem: algorithms and computations. Math. Program. 103(3), 609\u2013631 (2005)","journal-title":"Math. Program."},{"key":"224_CR25","first-page":"29","volume-title":"The Vehicle Routing Problem","author":"P. Toth","year":"2001","unstructured":"Toth P., Vigo D.: Branch-and-bound algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, pp. 29\u201352. SIAM, Philadelphia (2001)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0224-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0224-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0224-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:05Z","timestamp":1559109005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0224-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,17]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["224"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0224-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,17]]}}}