Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs

Published Online:https://doi.org/10.1287/ijoc.1080.0300

References

  • Ahmed S., Tawarmalani M., Sahinidis N. V. A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program. (2004) 100(2):355–377CrossrefGoogle Scholar
  • Alonso-Ayuso A., Escudero L. F., Garín A., Ortuño M. T., Pérez G. An approach for strategic supply chain planning under uncertainty based on stochastic 0–1 programming. J. Global Optim. (2003) 26(1):97–124CrossrefGoogle Scholar
  • Balas E., Perregaard M. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Program. (2003) 94(2):221–245CrossrefGoogle Scholar
  • ILOG CPLEX (2000) . CPLEX 7.0 Reference Manual, ILOG CPLEX Division, Incline Village, NVGoogle Scholar
  • Klein Haneveld W. K., van der Vlerk M. H. Stochastic integer programming: General models and algorithms. Ann. Oper. Res. (1999) 85:39–57CrossrefGoogle Scholar
  • Ntaimo L., Sen S. The million-variable “march” for stochastic combinatorial optimization. J. Global Optim. (2005) 32(3):385–400CrossrefGoogle Scholar
  • Ntaimo L., Sen S. A comparative study of decomposition algorithms for stochastic combinatorial optimization. Comp. Optim. Apps. (2008) 40(3):299–319CrossrefGoogle Scholar
  • Schultz R. Stochastic programming with integer variables. Math. Program. (2003) 97(1–2):285–309CrossrefGoogle Scholar
  • Sen S., Aardal K., Nemhauser G., Weismental R. Decomposition algorithms for stochastic mixed-integer programming models. Handbook of Discrete Optimization (2005) (Elsevier, Amsterdam) 515–558CrossrefGoogle Scholar
  • Sen S., Higle J. L. The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Program. (2005) 104(1):1–20CrossrefGoogle Scholar
  • Sen S., Sherali H. D. Facet inequalities from simple disjunctions in cutting plane theory. Math. Program. (1986) 34(1):72–83CrossrefGoogle Scholar
  • Sen S., Sherali H. D. Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. (2006) 106(2):203–223CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.