Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints

References

• Balas E., Mangasarian O., Meyer R., Robinson S. Disjunctive programming: Cutting planes from logical conditions. Nonlinear Programming 2 (1975) (Academic Press, New York) 279–312Crossref, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:3–31Crossref, Google Scholar
• Balas E., Jeroslow R. G. Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. (1980) 4(4):224–235Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming (1993) 58(1–3):295–324Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Management Sci. (1996) 42(9):1229–1246Link, Google Scholar
• Benders J. Partitioning procedures for solving mixed-variable programming problems. Numerische Math. (1962) 4:238–252Crossref, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
• Blair C. E. Facial disjunctive programs and sequences of cutting planes. Discrete Appl. Math. (1980) 2(3):173–179Crossref, Google Scholar
• Blair C. E., Jeroslow R. G. A converse for disjunctive constraints. J. Optim. Theory Appl. (1978) 25(2):195–206Crossref, Google Scholar
• Carøe C. Decomposition in stochastic integer programming. (1998) . Ph.D. thesis, University of Copenhagen, CopenhagenGoogle Scholar
• Carøe C., Tind J. A cutting-plane approach to mixed 0–1 stochastic integer programs. Eur. J. Oper. Res. (1997) 101(2):306–316Crossref, Google Scholar
• Jeroslow R. A cutting plane game for facial disjunctive programs. SIAM J. Control Optim. (1980) 18(3):264–281Crossref, Google Scholar
• Keller B. D. Models and methods for multiple resource constrained job scheduling under uncertainty. (2009) . Ph.D. dissertation, University of Arizona, TucsonGoogle Scholar
• Klein Haneveld W. K., van der Vlerk M. H. Stochastic integer programming: General models and algorithms. Ann. Oper. Res. (1999) 85:39–57Crossref, Google Scholar
• Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13(3):133–142Crossref, Google Scholar
• Ntaimo L. Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse. Oper. Res. (2010) 58(1):229–243Link, Google Scholar
• Ntaimo L., Sen S. A branch-and-cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variables. Internat. J. Comput. Sci. Engrg. (2007) 3(3):232–241Crossref, Google Scholar
• Ntaimo L., Sen S. A comparative study of decomposition algorithms for stochastic combinatorial optimization. Comput. Optim. Appl. (2008) 40(3):299–319Crossref, Google Scholar
• Ntaimo L., Tanner M. Computations with disjunctive cuts for two-stage stochastic mixed 0–1 integer programs. J. Global Optim. (2008) 41(3):365–384Crossref, Google Scholar
• Perregaard M., Balas E., Aardal K., Gerards B. Generating cuts from multiple-term disjunctions. Proc. IPCO VIII., Vol. 2081 (2001) (Springer-Verlag, Berlin) 348–360Lecture Notes in Computer ScienceCrossref, Google Scholar
• Schultz R. Continuity properties of expectation functions in stochastic integer programming. Math. Oper. Res. (1993) 18(3):578–589Link, Google Scholar
• Schultz R. Stochastic programming with integer variables. Math. Programming (2003) 97(1–2):285–309Crossref, Google Scholar
• Sen S., Aardal K., Nemhauser G. L., Weismental R. Decomposition algorithms for stochastic mixed-integer programming models. Handbooks in Operations Research and Management Science: Discrete Optimization (2005) 12(Elsevier, Amsterdam) 515–558Google Scholar
• Sen S., Higle J. L. The C3 theorem and D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Programming (2005) 104(1):1–20Crossref, Google Scholar
• Sen S., Sherali H. D. On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs. Math. Programming (1985) 31(1):42–56Crossref, Google Scholar
• Sen S., Sherali H. D. Nondifferentiable reverse convex programs and facetial cuts via a disjunctive characterization. Math. Programming (1987) 37(2):169–183Crossref, Google Scholar
• Sen S., Sherali H. D. Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Programming (2006) 106(2):203–223Crossref, Google Scholar
• Sherali H. D., Shetty C.Optimization with Disjunctive Constraints (1980) (Springer-Verlag, Berlin) Crossref, Google Scholar
• van Slyke R. M., Wets R. L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. (1969) 17(4):638–663Crossref, Google Scholar
• Wolsey L. Valid inequalities for 0–1 knapsacks and MIPs with generalised upper bound constraints. Discrete Appl. Math. (1990) 29(2–3):251–261Crossref, Google Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley & Sons, New York) Google Scholar
• Yuan Y., Sen S. Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs. INFORMS J. Comput. (2009) 21(3):480–487Link, Google Scholar
• Zhang W., Louis P. P., Bayraksan G., Lansey K., Chung G. Reclaimed water network design under temporal and spatial growth and demand uncertainties. (2011) . Working paper, University of Arizona, TucsonGoogle Scholar