A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables

Can Li, Ignacio E. Grossmann. A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables. J. Global Optimization, 75(2):247-272, 2019. [doi]

@article{LiG19-20,
  title = {A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables},
  author = {Can Li and Ignacio E. Grossmann},
  year = {2019},
  doi = {10.1007/s10898-019-00816-8},
  url = {https://doi.org/10.1007/s10898-019-00816-8},
  researchr = {https://researchr.org/publication/LiG19-20},
  cites = {0},
  citedby = {0},
  journal = {J. Global Optimization},
  volume = {75},
  number = {2},
  pages = {247-272},
}