Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse

References

• Balas E, Saxena A (2008) Optimizing over the split closure. Math. Program. 113(2):219–240.Crossref, Google Scholar
• Balas E, Ceria S, Cornuejols G, Natraj N (1996) Gomory cuts revisited. Oper. Res. Lett. 19(1):1–9.Crossref, Google Scholar
• Beasley JE (1990) OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11):1069–1072.Crossref, Google Scholar
• Beier E, Venkatachalam S, Corolli L, Ntaimo L (2015) Stage-and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure. Comput. Oper. Res. 59:94–103.Crossref, Google Scholar
• Bienstock D, Günlük O (1996) Capacitated network design—Polyhedral structure and computation. INFORMS J. Comput. 8(3):243–259.Link, Google Scholar
• Bonami P (2012) On optimizing over lift-and-project closures. Math. Program. Comput. 4(2):151–179.Crossref, Google Scholar
• Caprara A, Letchford A (2003) On the separation of split cuts and related inequalities. Math. Program. 94(2):279–294.Crossref, Google Scholar
• Carøe CC (1998) Decomposition in stochastic integer programming. Ph.D. thesis, Department of Operations Research, University of Copenhagen, Denmark.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 (1998) L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83(1):451–464.Crossref, Google Scholar
• Cornuéjols G, Li Y (2002) On the rank of mixed 0, 1 polyhedra. Math. Program. 91(2):391–397.Crossref, Google Scholar
• Dash S, Goycoolea M (2010) A heuristic to separate rank-1 GMI cuts. Math. Program. Comput. 2(3):231–257.Crossref, Google Scholar
• Dash S, Günlük O, Lodi A (2010) MIR closures of polyhedral sets. Math. Program. 121(1):33–60.Crossref, Google Scholar
• Fischetti M, Salvagnin D (2011) A relax-and-cut framework for Gomory’s mixed-integer cuts. Math. Program. Comput. 3(2):79–102.Crossref, Google Scholar
• Gade D, Küçükyavuz S, Sen S (2014) Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1–2):39–64.Crossref, Google Scholar
• Louveaux FV (1986) Discrete stochastic location models. Ann. Oper. Res. 6(2):23–34.Crossref, Google Scholar
• Lovász L, Schrijver A (1991) Cones of matrices and set-functions and 0-1 optimization. SIAM J. Opt. 1(2):166–190.Crossref, Google Scholar
• Modaresi S, Kılınç MR, Vielma JP (2015) Split cuts and extended formulations for mixed integer conic quadratic programming. Oper. Res. Lett. 43(1):10–15.Crossref, Google Scholar
• Ntaimo L (2013) Fenchel decomposition for stochastic mixed-integer programming. J. Global. Opt. 55(1):141–163.Crossref, Google Scholar
• Pan F, Morton DP (2008) Minimizing a stochastic maximum-reliability path. Networks 52(3):111–119.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. Program. 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. Program. 106(2):203–223.Crossref, Google Scholar
• Tanner MW, Ntaimo L (2008) Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs. J. Global. Opt. 58(3):365–384.Google Scholar
• Van Slyke R, Wets RJ-B (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math 17(4):638–663.Crossref, Google Scholar
• Zhang M, Küçükyavuz S (2014) Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Opt. 24(4):1933–1951.Crossref, Google Scholar