Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty

References

• Ahmed S, Tawarmalani M, Sahinidis NV (2004) A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Programming 100(2):355–377.Crossref, Google Scholar
• Balas E, Jeroslow RG (1980) Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4):224–234.Crossref, Google Scholar
• Bansal M, Huang K-L, Mehrotra S (2018) Tight second stage formulations in two-stage stochastic mixed integer programs. SIAM J. Optim. 28(1):788–819.Crossref, Google Scholar
• Blair CE, Jeroslow RG (1979) The value function of a mixed integer program: II. Discrete Math. 25(1):7–19.Crossref, Google Scholar
• Bodur M, Dash S, Günlük O, Luedtke J (2017) Strengthened benders cuts for stochastic integer programs with continuous recourse. INFORMS J. Comput. 29(1):77–91.Link, Google Scholar
• Carøe CC, Schultz R (1999) Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1–2):37–45.Crossref, Google Scholar
• Carøe CC, Tind J (1997) A cutting-plane approach to mixed 0-1 stochastic integer programs. European J. Oper. Res. 101(2):306–316.Crossref, Google Scholar
• Cook W, Gerards AMH, Schrijver A, Tardos É (1986) Sensitivity theorems in integer linear programming. Math. Programming 34(3):251–264.Crossref, Google Scholar
• Gade D, Küçükyavuz S, Sen S (2014) Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Programming 144(1–2):39–64.Crossref, Google Scholar
• Guan Y, Ahmed S, Nemhauser GL (2009) Cutting planes for multistage stochastic integer programs. Oper. Res. 57(2):287–298.Link, Google Scholar
• Han Y, Chen Z (2015) Quantitative stability of full random two-stage stochastic programs with recourse. Optim. Lett. 9(6):1075–1090.Crossref, Google Scholar
• Kim K, Mehrotra S (2015) A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management. Oper. Res. 63(6):1431–1451.Link, Google Scholar
• Klein Haneveld WK, Stougie L, van der Vlerk MH (2006) Simple integer recourse models: convexity and convex approximations. Math. Programming 108(2-3):435–473.Crossref, Google Scholar
• Kleywegt AJ, Shapiro A, Homem de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Louveaux FV, van der Vlerk MH (1993) Stochastic programming with simple integer recourse. Math. Programming 61(1-3):301–325.Crossref, Google Scholar
• Marchand H, Martin A, Weismantel R, Wolsey L (2002) Cutting planes in integer and mixed integer programming. Discrete Appl. Math. 123(1-3):397–446.Crossref, Google Scholar
• Ntaimo L (2010) Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse. Oper. Res. 58(1):229–243.Link, Google Scholar
• Ntaimo L, Sen S (2005) The million-variable “march” for stochastic combinatorial optimization. J. Global Optim. 32(3):385–400.Crossref, Google Scholar
• Qi Y, Sen S (2017) The Ancestral Benders’ cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Math. Programming 161(1–2):193–235.Crossref, Google Scholar
• Rinnooy Kan AHG, Stougie L (1988) Stochastic integer programming. Yu E, Wets RJ-B, eds. Numerical Techniques for Stochastic Optimization, vol. 10 (Springer, New York), 201–213.Google Scholar
• Romeijnders W, Schultz R, van der Vlerk MH, Klein Haneveld WK (2016a) A convex approximation for two-stage mixed-integer recourse models with a uniform error bound. SIAM J. Optim. 26(1):426–447.Crossref, Google Scholar
• Romeijnders W, van der Vlerk MH, Klein Haneveld WK (2015) Convex approximations of totally unimodular integer recourse models: a uniform error bound. SIAM J. Optim. 25(1):130–158.Crossref, Google Scholar
• Romeijnders W, van der Vlerk MH, Klein Haneveld WK (2016b) Total variation bounds on the expectation of periodic functions with applications to recourse approximations. Math. Programming 157(1):3–46.Crossref, Google Scholar
• Schultz R, Stougie L, van der Vlerk MH (1998) Solving stochastic programs with integer recourse by enumeration: a framework using Gröbner basis reductions. Math. Programming 83(1–3):229–252.Crossref, Google Scholar
• Sen S, Higle JL (2005) The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Programming 104(1):1–20.Crossref, Google Scholar
• Sen S, Sherali HD (2006) Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Programming 106(2):203–223.Crossref, Google Scholar
• Sherali HD, Zhu X (2006) On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables. Math. Programming 108(2-3):597–616.Crossref, Google Scholar
• van der Laan N, Romeijnders W, van der Vlerk MH (2018) Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations. Comput. Management Sci. 15(3-4):325–349.Crossref, Google Scholar
• van der Vlerk MH (1995) Stochastic progamming with integer recourse. Thesis Rijksuniversiteit Groningen, Theses on Systems, Organisations, and Management, Labyrint Publications, Capelle a/d IJssel.Google Scholar
• van der Vlerk MH (2004) Convex approximations for complete integer recourse models. Math. Programming 99(2):297–310.Crossref, Google Scholar
• van der Vlerk MH (2010) Convex approximations for a class of mixed-integer recourse models. Ann. Oper. Res. 177(1):139–150.Crossref, Google Scholar
• van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4):638–663.Crossref, Google Scholar
• Walkup DW, Wets RJ-B (1969) Lifting projections of convex polyhedra. Pacific J. Math. 28(2):465–475.Crossref, Google Scholar
• Zhang M, Küçükyavuz S (2014) Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Optim. 24(4):1933–1951.Crossref, Google Scholar