{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T05:17:34Z","timestamp":1780723054247,"version":"3.54.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,3,11]],"date-time":"2012-03-11T00:00:00Z","timestamp":1331424000000},"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":[[2013,4]]},"DOI":"10.1007\/s10107-012-0520-4","type":"journal-article","created":{"date-parts":[[2012,3,10]],"date-time":"2012-03-10T03:43:26Z","timestamp":1331351006000},"page":"199-221","source":"Crossref","is-referenced-by-count":14,"title":["Stochastic binary problems with simple penalties for capacity constraints violations"],"prefix":"10.1007","volume":"138","author":[{"given":"B.","family":"Fortz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Labb\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Louveaux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Poss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,11]]},"reference":[{"issue":"4","key":"520_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K. Abhishek","year":"2010","unstructured":"Abhishek K., Leyffer S., Linderoth J.T.: Filmint: an outer-approximation-based solver for nonlinear mixed integer programs. INFORMS J. Comput. 22(4), 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"520_CR2","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/moor.23.3.649","volume":"23","author":"T. Badics","year":"1998","unstructured":"Badics T., Boros E.: Minimization of half-products. Math. Oper. Res. 23(3), 649\u2013660 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"520_CR3","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C. Barnhart","year":"2000","unstructured":"Barnhart C., Hane C.A., Vance P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318\u2013326 (2000)","journal-title":"Oper. Res."},{"key":"520_CR4","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.E.: An exact approach for solving integer problem under probabilistic constraints with random technology matrix. Ann. Oper. Res. 177, 127\u2013137 (2010)","journal-title":"Ann. Oper. Res."},{"key":"520_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic programming","author":"J.R. Birge","year":"2011","unstructured":"Birge J.R., Louveaux F.V.: Introduction to Stochastic programming (2nd edn). Springer, New-York (2011)","edition":"2"},{"issue":"2","key":"520_CR6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami P., Biegler L.T., Conn A.R., Cornu\u00e9jols G., Grossmann I.E., Laird C.D., Lee J., Lodi A., Margot F., Sawaya N., W\u00e4chter A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"520_CR7","doi-asserted-by":"crossref","unstructured":"Bonami, P., Kilinc, M., Linderoth, J.: IMA Volumes. University of Minnesota. Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2010)","DOI":"10.1007\/978-1-4614-1927-3_1"},{"key":"520_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","volume":"27","author":"G.G. Brown","year":"1981","unstructured":"Brown G.G., Graves G.W.: Real-time dispatch of petroleum tank trucks. Manage. Sci. 27, 19\u201332 (1981)","journal-title":"Manage. Sci."},{"issue":"3","key":"520_CR9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"D.G. Cattrysse","year":"1992","unstructured":"Cattrysse D.G., Van Wassenhove L.N.: A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60(3), 260\u2013272 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"520_CR10","unstructured":"Cohn, A., Barnhart, C.: The stochastic knapsack problem with random weights: a heuristic approach to robust transportation planning. In: Proceedings of the Triennial Symposium on Transportation Analysis (TRISTAN III) (1998)"},{"issue":"2","key":"520_CR11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.25.2.361","volume":"25","author":"B. Hansotia","year":"1977","unstructured":"Hansotia B.: Some special cases of stochastic programs with recourse. Oper. Res. 25(2), 361\u2013363 (1977)","journal-title":"Oper. Res."},{"key":"520_CR12","unstructured":"ILOG CPLEX Division, Gentilly, France. ILOG. ILOG CPLEX 11.0 Reference Manual (2007)"},{"key":"520_CR13","unstructured":"Klein Haneveld, W.K., Stougie, L., van der Vlerk, M.H.: Stochastic integer programming with simple recourse. Technical Report Research Memorandum 455, University of Groningen (1991)"},{"issue":"1","key":"520_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/opre.49.1.26.11185","volume":"49","author":"A.J. Kleywegt","year":"2001","unstructured":"Kleywegt A.J., Papastavrou J.D.: The dynamic and stochastic knapsack problem with random sized items. Oper. Res. 49(1), 26\u201341 (2001)","journal-title":"Oper. Res."},{"issue":"2","key":"520_CR15","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A.J. Kleywegt","year":"2002","unstructured":"Kleywegt A.J., Shapiro A., Homemde Mello T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"520_CR16","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s10589-008-9177-6","volume":"45","author":"O. Klopfenstein","year":"2010","unstructured":"Klopfenstein O.: Solving chance-constrained combinatorial problems to optimality. Comput. Optim. Appl. 45(3), 607\u2013638 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"520_CR17","unstructured":"Klopfenstein, O., Nace, D.: A note on polyhedral aspects of a robust knapsack problem. Optim. Online (2007)"},{"issue":"5","key":"520_CR18","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.orl.2008.03.006","volume":"36","author":"O. Klopfenstein","year":"2008","unstructured":"Klopfenstein O., Nace D.: A robust approach to the chance-constrained knapsack problem. Oper. Res. Lett. 36(5), 628\u2013632 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"520_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10479-009-0577-5","volume":"176","author":"S. Kosuch","year":"2010","unstructured":"Kosuch S., Lisser A.: Upper bounds for the 0-1 stochastic knapsack problem and a b&b algorithm. Ann. Oper. Res. 176(1), 77\u201393 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"520_CR20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G. Laporte","year":"1992","unstructured":"Laporte G., Louveaux F.V., Mercure H.: The vehicle routing problem with stochastic travel times. Transp. Sci. 26(3), 161\u2013170 (1992)","journal-title":"Transp. Sci."},{"key":"520_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01582153","volume":"61","author":"F.V. Louveaux","year":"1993","unstructured":"Louveaux F.V., van der Vlerk M.H.: Stochastic programming with simple integer recourse. Math. Program. 61, 301\u2013325 (1993)","journal-title":"Math. Program."},{"issue":"3","key":"520_CR22","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"Martello S., Pisinger D., Toth P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Manage. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manage. Sci."},{"key":"520_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4757-2807-1_5","volume-title":"Advances in computational and stochastic optimization, logic programming and Heuristic Search, chapter 5","author":"D.P. Morton","year":"1998","unstructured":"Morton D.P., Wood R.K.: Advances in computational and stochastic optimization, logic programming and Heuristic Search, chapter 5, pp. 149\u2013168. Kluwer, Dordrecht (1998)"},{"issue":"2","key":"520_CR24","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"J.M. Mulvey","year":"1995","unstructured":"Mulvey J.M., Vanderbei R.J., Stavros A.Z.: Robust optimization of large-scale systems. Oper. Res. 43(2), 264\u2013281 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"520_CR25","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"R.M. Nauss","year":"2003","unstructured":"Nauss R.M.: Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J. Comput. 15(3), 249\u2013266 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"520_CR26","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D. Pisinger","year":"1999","unstructured":"Pisinger D.: An exact algorithm for large multiple knapsack problems. Eur. J. Oper. Res. 114(3), 528\u2013541 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"520_CR27","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, Dordrecht (1995)"},{"issue":"10\/11","key":"520_CR28","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I. Quesada","year":"1992","unstructured":"Quesada I., Grossman I.E.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10\/11), 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"520_CR29","unstructured":"Spoerl, D., Wood, R.K.: A stochastic generalized assignment problem. INFORMS Annual Meeting, Atlanta, GA, 19\u201322 October (2003)"},{"issue":"3","key":"520_CR30","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/17442508308833274","volume":"10","author":"R.J.B. Wets","year":"1983","unstructured":"Wets R.J.B.: Solving stochastic programss with simple recourse. Stochastics 10(3), 219\u2013242 (1983)","journal-title":"Stochastics"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0520-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0520-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0520-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T04:18:03Z","timestamp":1561436283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0520-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,11]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["520"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0520-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,11]]}}}