Siavash Tabrizian: A sampling-based branch and cut algorithm for two-stage stochastic mixed integer programs

Winner: Operations Research (Graduate)

Stochastic mixed-integer programs are among the most challenging class of optimization problems that finds many applications in practice. In this presentation, we describe a novel algorithmic framework for solving two-stage stochastic mixed-integer programs using internal sampling.

Siavash Tabrizian
Program: PhD in Operations Research
Faculty mentor: Harsha Gangammanavar

Leave a Reply

Your email address will not be published. Required fields are marked *