{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:31:36Z","timestamp":1769751096163,"version":"3.49.0"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10107-022-01876-7","type":"journal-article","created":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T14:02:32Z","timestamp":1661004152000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems"],"prefix":"10.1007","volume":"196","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James R.","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,20]]},"reference":[{"issue":"1","key":"1876_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/moor.2019.1048","volume":"46","author":"A Abdi","year":"2021","unstructured":"Abdi, A., Cornu\u00e9jols, G., Lee, D.: Resistant sets in the unit hypercube. Math. Oper. Res. 46(1), 82\u2013114 (2021)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1876_CR2","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-005-0638-8","volume":"106","author":"S Ahmed","year":"2006","unstructured":"Ahmed, S.: Convexity and decomposition of mean-risk stochastic programs. Math. Program. 106(3), 433\u2013446 (2006)","journal-title":"Math. Program."},{"issue":"6","key":"1876_CR3","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.orl.2013.07.009","volume":"41","author":"S Ahmed","year":"2013","unstructured":"Ahmed, S.: A scenario decomposition algorithm for 0\u20131 stochastic programs. Oper. Res. Lett. 41(6), 565\u2013569 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1876_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-013-0624-7","volume":"8","author":"S Ahmed","year":"2014","unstructured":"Ahmed, S.: Convex relaxations of chance constrained optimization problems. Optim. Lett. 8(1), 1\u201312 (2014)","journal-title":"Optim. Lett."},{"issue":"1","key":"1876_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128(1), 149\u2013169 (2011)","journal-title":"Math. Program."},{"key":"1876_CR6","doi-asserted-by":"crossref","unstructured":"Ahmed, S., Cabral, F.G., Freitas Paulo\u00a0da Costa, B.: Stochastic Lipschitz dynamic programming. In: Math. Program. pp. 1\u201339 (2020)","DOI":"10.1007\/s10107-020-01569-z"},{"issue":"1","key":"1876_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1023062915106","volume":"26","author":"S Ahmed","year":"2003","unstructured":"Ahmed, S., King, A.J., Parija, G.: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. J. Glob. Optim. 26(1), 3\u201324 (2003)","journal-title":"J. Glob. Optim."},{"issue":"1\u20132","key":"1876_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10107-016-1029-z","volume":"162","author":"S Ahmed","year":"2017","unstructured":"Ahmed, S., Luedtke, J., Song, Y., Xie, W.: Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. Math. Program. 162(1\u20132), 51\u201381 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1876_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.51.3.461.14960","volume":"51","author":"S Ahmed","year":"2003","unstructured":"Ahmed, S., Sahinidis, N.V.: An approximation scheme for stochastic integer programs arising in capacity expansion. Oper. Res. 51(3), 461\u2013471 (2003)","journal-title":"Oper. Res."},{"key":"1876_CR10","unstructured":"Ahmed, S., Shapiro, A.: The sample average approximation method for stochastic programs with integer recourse (2002). http:\/\/www.optimization-online.org\/DB_FILE\/2002\/02\/440.pdf"},{"issue":"2","key":"1876_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-003-0475-6","volume":"100","author":"S Ahmed","year":"2004","unstructured":"Ahmed, S., Tawarmalani, M., Sahinidis, N.V.: A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program. 100(2), 355\u2013377 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"1876_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10107-018-1295-z","volume":"170","author":"S Ahmed","year":"2018","unstructured":"Ahmed, S., Xie, W.: Relaxations and approximations of chance constraints under finite distributions. Math. Program. 170(1), 43\u201365 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"1876_CR13","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.ejor.2006.07.016","volume":"182","author":"S Ahmed","year":"2007","unstructured":"Ahmed, S., \u00c7akmak, U., Shapiro, A.: Coherent risk measures in inventory problems. Eur. J. Oper. Res. 182(1), 226\u2013238 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1876_CR14","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/ijoc.2016.0695","volume":"28","author":"G Angulo","year":"2016","unstructured":"Angulo, G., Ahmed, S., Dey, S.S.: Improving the integer L-shaped method. INFORMS J. Comput. 28(3), 483\u2013499 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1876_CR15","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1287\/moor.2014.0673","volume":"40","author":"G Angulo","year":"2015","unstructured":"Angulo, G., Ahmed, S., Dey, S.S., Kaibel, V.: Forbidden vertices. Math. Oper. Res. 40(2), 350\u2013360 (2015)","journal-title":"Math. Oper. Res."},{"key":"1876_CR16","doi-asserted-by":"publisher","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Submodular function minimization and polarity. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01607-w","DOI":"10.1007\/s10107-020-01607-w"},{"issue":"6","key":"1876_CR17","doi-asserted-by":"publisher","first-page":"6755","DOI":"10.1109\/TPWRS.2018.2829175","volume":"33","author":"B Basciftci","year":"2018","unstructured":"Basciftci, B., Ahmed, S., Gebraeel, N.Z., Yildirim, M.: Stochastic optimization of maintenance and operations schedules under unexpected failures. IEEE Trans. Power Syst. 33(6), 6755\u20136765 (2018). https:\/\/doi.org\/10.1109\/TPWRS.2018.2829175","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"1876_CR18","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2020.11.002","volume":"292","author":"B Basciftci","year":"2021","unstructured":"Basciftci, B., Ahmed, S., Shen, S.: Distributionally robust facility location problem under decision-dependent stochastic demand. Eur. J. Oper. Res. 292(2), 548\u2013561 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1876_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"key":"1876_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01765-5","author":"M Bodur","year":"2022","unstructured":"Bodur, M., Ahmed, S., Boland, N., Nemhauser, G.L.: Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01765-5","journal-title":"Math. Program."},{"key":"1876_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01763-7","author":"S Bolusani","year":"2022","unstructured":"Bolusani, S., Ralphs, T.K.: A framework for generalized Benders\u2019 decomposition and its application to multilevel optimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01763-7","journal-title":"Math. Program."},{"key":"1876_CR22","doi-asserted-by":"publisher","unstructured":"Castro, M.P., Cire, A.A., Beck, J.C.: A combinatorial cut-and-lift procedure with an application to 0\u20131 second-order conic programming. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01699-y","DOI":"10.1007\/s10107-021-01699-y"},{"key":"1876_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01823-6","author":"A Chandra","year":"2022","unstructured":"Chandra, A., Tawarmalani, M.: Probability estimation via policy restrictions, convexification, and approximate sampling. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01823-6","journal-title":"Math. Program."},{"key":"1876_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01753-9","author":"R Chen","year":"2022","unstructured":"Chen, R., Luedtke, J.: On sample average approximation for two-stage stochastic programs without relatively complete recourse. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01753-9","journal-title":"Math. Program."},{"key":"1876_CR25","doi-asserted-by":"publisher","unstructured":"Cheon, M.S.: An outer-approximation guided optimization approach for constrained neural network inverse problems. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01653-y","DOI":"10.1007\/s10107-021-01653-y"},{"key":"1876_CR26","doi-asserted-by":"publisher","unstructured":"Coniglio, S., Furini, F., Ljubi\u0107, I.: Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01864-x","DOI":"10.1007\/s10107-022-01864-x"},{"key":"1876_CR27","doi-asserted-by":"publisher","unstructured":"Cordova, M., Oliveira, W.d., Sagastiz\u00e1bal, C.: Revisiting augmented Lagrangian duals. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01703-5","DOI":"10.1007\/s10107-021-01703-5"},{"issue":"1","key":"1876_CR28","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/ijoc.2017.0767","volume":"30","author":"Y Deng","year":"2018","unstructured":"Deng, Y., Ahmed, S., Shen, S.: Parallel scenario decomposition of risk-averse 0\u20131 stochastic programs. INFORMS J. Comput. 30(1), 90\u2013105 (2018)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1876_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-018-1302-4","volume":"170","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Molinaro, M.: Theoretical challenges towards cutting-plane selection. Math. Program. 170(1), 237\u2013266 (2018)","journal-title":"Math. Program."},{"key":"1876_CR30","doi-asserted-by":"publisher","unstructured":"Dowson, O., Morton, D.P., Downward, A.: Bi-objective multistage stochastic linear programming. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01872-x","DOI":"10.1007\/s10107-022-01872-x"},{"issue":"1","key":"1876_CR31","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-016-1012-8","volume":"161","author":"MJ Feizollahi","year":"2017","unstructured":"Feizollahi, M.J., Ahmed, S., Sun, A.: Exact augmented Lagrangian duality for mixed integer linear programming. Math. Program. 161(1), 365\u2013387 (2017)","journal-title":"Math. Program."},{"key":"1876_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01740-0","author":"C F\u00fcllner","year":"2022","unstructured":"F\u00fcllner, C., Rebennack, S.: Non-convex nested Benders decomposition. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01740-0","journal-title":"Math. Program."},{"key":"1876_CR33","doi-asserted-by":"publisher","unstructured":"Gonzalez Grandon, T., Henrion, R., P\u00e9rez-Aros, P.: Dynamic probabilistic constraints under continuous random distributions. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01593-z","DOI":"10.1007\/s10107-020-01593-z"},{"key":"1876_CR34","doi-asserted-by":"crossref","unstructured":"Gu, X., Ahmed, S., Dey, S.S.: Exact augmented Lagrangian duality for mixed integer quadratic programming. SIAM J. Optim. 30(1), 781\u2013797 (2020)","DOI":"10.1137\/19M1271695"},{"issue":"1","key":"1876_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.disopt.2006.10.003","volume":"4","author":"Y Guan","year":"2007","unstructured":"Guan, Y., Ahmed, S., Nemhauser, G.L.: Sequential pairing of mixed integer inequalities. Discret. Optim. 4(1), 21\u201339 (2007)","journal-title":"Discret. Optim."},{"issue":"2","key":"1876_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/opre.1080.0535","volume":"57","author":"Y Guan","year":"2009","unstructured":"Guan, Y., Ahmed, S., Nemhauser, G.L.: Cutting planes for multistage stochastic integer programs. Oper. Res. 57(2), 287\u2013298 (2009)","journal-title":"Oper. Res."},{"issue":"1","key":"1876_CR37","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0572-9","volume":"105","author":"Y Guan","year":"2006","unstructured":"Guan, Y., Ahmed, S., Nemhauser, G.L., Miller, A.J.: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Program. 105(1), 55\u201384 (2006)","journal-title":"Math. Program."},{"key":"1876_CR38","doi-asserted-by":"publisher","unstructured":"Gupta, S., Khodabakhsh, A., Mortagy, H., Nikolova, E.: Electrical flows over spanning trees. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01614-x","DOI":"10.1007\/s10107-020-01614-x"},{"key":"1876_CR39","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2015.08.010","volume":"201","author":"A Gupte","year":"2016","unstructured":"Gupte, A.: Convex hulls of superincreasing knapsacks and lexicographic orderings. Discret. Appl. Math. 201, 150\u2013163 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1876_CR40","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte, A., Ahmed, S., Cheon, M.S., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721\u2013744 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1876_CR41","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-016-0434-4","volume":"67","author":"A Gupte","year":"2017","unstructured":"Gupte, A., Ahmed, S., Dey, S.S., Cheon, M.S.: Relaxations and discretizations for the pooling problem. J. Global Optim. 67(3), 631\u2013669 (2017)","journal-title":"J. Global Optim."},{"key":"1876_CR42","doi-asserted-by":"publisher","unstructured":"Hazimeh, H., Mazumder, R., Saab, A.: Sparse regression at scale: branch-and-bound rooted in first-order optimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01712-4","DOI":"10.1007\/s10107-021-01712-4"},{"issue":"1","key":"1876_CR43","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10107-014-0752-6","volume":"150","author":"Q He","year":"2015","unstructured":"He, Q., Ahmed, S., Nemhauser, G.L.: Minimum concave cost flow over a grid network. Math. Program. 150(1), 79\u201398 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1876_CR44","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TSTE.2018.2805164","volume":"10","author":"MN Hjelmeland","year":"2018","unstructured":"Hjelmeland, M.N., Zou, J., Helseth, A., Ahmed, S.: Nonconvex medium-term hydropower scheduling by stochastic dual dynamic integer programming. IEEE Trans. Sustain. Energy 10(1), 481\u2013490 (2018)","journal-title":"IEEE Trans. Sustain. Energy"},{"key":"1876_CR45","doi-asserted-by":"publisher","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. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01605-y","DOI":"10.1007\/s10107-020-01605-y"},{"key":"1876_CR46","doi-asserted-by":"publisher","unstructured":"Ko\u00e7yi\u011fit, \u00c7., Rujeerapaiboon, N., Kuhn, D.: Robust multidimensional pricing: Separation without regret. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01615-4","DOI":"10.1007\/s10107-021-01615-4"},{"issue":"3","key":"1876_CR47","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3), 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1876_CR48","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. Optim. 19(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1876_CR49","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","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. 122(2), 247\u2013272 (2010)","journal-title":"Math. Program."},{"key":"1876_CR50","doi-asserted-by":"publisher","unstructured":"Luo, F., Mehrotra, S.: A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01641-2","DOI":"10.1007\/s10107-021-01641-2"},{"key":"1876_CR51","doi-asserted-by":"publisher","unstructured":"Mahmuto\u011fullar\u0131, A.I., Ahmed, S., \u00c7avu\u015f, O., Akt\u00fcrk, M.S.: The value of multi-stage stochastic programming in risk-averse unit commitment under uncertainty. IEEE Trans. Power Syst. 34(5), 3667\u20133676 (2019). https:\/\/doi.org\/10.1109\/TPWRS.2019.2902511","DOI":"10.1109\/TPWRS.2019.2902511"},{"key":"1876_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01767-3","author":"E Malaguti","year":"2022","unstructured":"Malaguti, E., Monaci, M., Pruente, J.: K-adaptability in stochastic optimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01767-3","journal-title":"Math. Program."},{"key":"1876_CR53","doi-asserted-by":"publisher","unstructured":"Muir, C., Toriello, A.: Dynamic node packing. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01624-3","DOI":"10.1007\/s10107-021-01624-3"},{"key":"1876_CR54","doi-asserted-by":"publisher","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.V.: SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01680-9","DOI":"10.1007\/s10107-021-01680-9"},{"issue":"2","key":"1876_CR55","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1876_CR56","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/ijoc.2013.0582","volume":"26","author":"F Qiu","year":"2014","unstructured":"Qiu, F., Ahmed, S., Dey, S.S., Wolsey, L.A.: Covering linear programming with violations. INFORMS J. Comput. 26(3), 531\u2013546 (2014)","journal-title":"INFORMS J. Comput."},{"key":"1876_CR57","doi-asserted-by":"publisher","unstructured":"Ragavan, P.K., Hunter, S.R., Pasupathy, R., Taaffe, M.R.: Adaptive sampling line search for local stochastic optimization with integer variables. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01667-6","DOI":"10.1007\/s10107-021-01667-6"},{"key":"1876_CR58","doi-asserted-by":"publisher","unstructured":"Ramirez-Pico, C., Moreno, E.: Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01609-8","DOI":"10.1007\/s10107-020-01609-8"},{"issue":"1","key":"1876_CR59","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1), 96\u2013115 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1876_CR60","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2008.11.040","volume":"199","author":"P Sch\u00fctz","year":"2009","unstructured":"Sch\u00fctz, P., Tomasgard, A., Ahmed, S.: Supply chain design under uncertainty using sample average approximation and dual decomposition. Eur. J. Oper. Res. 199(2), 409\u2013419 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1876_CR61","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/S1052623403434012","volume":"14","author":"A Shapiro","year":"2004","unstructured":"Shapiro, A., Ahmed, S.: On a class of minimax stochastic programs. SIAM J. Optim. 14(4), 1237\u20131249 (2004)","journal-title":"SIAM J. Optim."},{"key":"1876_CR62","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1287\/mnsc.1100.1208","volume":"56","author":"S Shen","year":"2010","unstructured":"Shen, S., Smith, J., Ahmed, S.: Expectation and chance-constrained models and algorithms for insuring critical paths. Manag. Sci. 56, 1794\u20131814 (2010)","journal-title":"Manag. Sci."},{"key":"1876_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01801-y","author":"X Shi","year":"2022","unstructured":"Shi, X., Prokopyev, O.A., Zeng, B.: Sequence independent lifting for a set of submodular maximization problems. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01801-y","journal-title":"Math. Program."},{"key":"1876_CR64","doi-asserted-by":"publisher","unstructured":"Song, Y., Khan, K.A.: Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01654-x","DOI":"10.1007\/s10107-021-01654-x"},{"key":"1876_CR65","doi-asserted-by":"publisher","unstructured":"Stozhkov, V., Buchanan, A., Butenko, S., Boginski, V.: Continuous cubic formulations for cluster detection problems in networks. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01572-4","DOI":"10.1007\/s10107-020-01572-4"},{"issue":"4","key":"1876_CR66","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Ahmed, S., et al.: Global optimization of 0\u20131 hyperbolic programs. J. Glob. Optim. 24(4), 385\u2013416 (2002)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1876_CR67","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24(2), 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1876_CR68","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"3","key":"1876_CR69","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. INFORMS J. Comput. 20(3), 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."},{"key":"1876_CR70","doi-asserted-by":"publisher","unstructured":"Wiebe, J., Cec\u00edlio, I., Dunlop, J., Misener, R.: A robust approach to warped Gaussian process-constrained optimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01762-8","DOI":"10.1007\/s10107-021-01762-8"},{"issue":"2","key":"1876_CR71","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1109\/TPWRS.2017.2725581","volume":"33","author":"W Xie","year":"2017","unstructured":"Xie, W., Ahmed, S.: Distributionally robust chance constrained optimal power flow with renewables: a conic reformulation. IEEE Trans. Power Syst. 33(2), 1860\u20131867 (2017)","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"1876_CR72","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10287-018-0313-1","volume":"15","author":"W Xie","year":"2018","unstructured":"Xie, W., Ahmed, S.: Distributionally robust simple integer recourse. CMS 15(3), 351\u2013367 (2018)","journal-title":"CMS"},{"issue":"2","key":"1876_CR73","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1137\/16M1094725","volume":"28","author":"W Xie","year":"2018","unstructured":"Xie, W., Ahmed, S.: On deterministic reformulations of distributionally robust joint chance constrained optimization problems. SIAM J. Optim. 28(2), 1151\u20131182 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1876_CR74","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10107-017-1190-z","volume":"172","author":"W Xie","year":"2018","unstructured":"Xie, W., Ahmed, S.: On quantile cuts and their closure for chance constrained optimization problems. Math. Program. 172(1), 621\u2013646 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"1876_CR75","first-page":"516","volume":"68","author":"W Xie","year":"2020","unstructured":"Xie, W., Ahmed, S.: Bicriteria approximation of chance-constrained covering problems. Oper. Res. 68(2), 516\u2013533 (2020)","journal-title":"Oper. Res."},{"key":"1876_CR76","doi-asserted-by":"publisher","unstructured":"Xie, W., Zhang, J., Ahmed, S.: Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01627-0","DOI":"10.1007\/s10107-021-01627-0"},{"issue":"1\u20132","key":"1876_CR77","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-016-1033-3","volume":"162","author":"J Yu","year":"2017","unstructured":"Yu, J., Ahmed, S.: Maximizing a class of submodular utility functions with constraints. Math. Program. 162(1\u20132), 145\u2013164 (2017)","journal-title":"Math. Program."},{"key":"1876_CR78","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2015.07.005","volume":"24","author":"J Yu","year":"2017","unstructured":"Yu, J., Ahmed, S.: Polyhedral results for a class of cardinality constrained submodular minimization problems. Discret. Optim. 24, 87\u2013102 (2017)","journal-title":"Discret. Optim."},{"key":"1876_CR79","doi-asserted-by":"publisher","unstructured":"Yu, X., Shen, S.: Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-020-01580-4","DOI":"10.1007\/s10107-020-01580-4"},{"key":"1876_CR80","doi-asserted-by":"publisher","unstructured":"Zhang, S., Sun, X.A.: Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01875-8","DOI":"10.1007\/s10107-022-01875-8"},{"issue":"3","key":"1876_CR81","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1109\/TPWRS.2018.2880996","volume":"34","author":"J Zou","year":"2018","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Multistage stochastic unit commitment using stochastic dual dynamic integer programming. IEEE Trans. Power Syst. 34(3), 1814\u20131823 (2018)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"1876_CR82","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-018-1249-5","volume":"175","author":"J Zou","year":"2019","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Stochastic dual dynamic integer programming. Math. Program. 175(1), 461\u2013502 (2019)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01876-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01876-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01876-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T11:08:50Z","timestamp":1668078530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01876-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":82,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1876"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01876-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,20]]},"assertion":[{"value":"20 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}