Now showing items 1-1 of 1
Stochastic Combinatorial Optimization with Applications in Graph Covering
We study stochastic combinatorial optimization models and propose methods for their solution. First, we consider a risk-neutral two-stage stochastic programming model for which the objective value function of the second-stage subproblems is submodular. Next, we consider risk-averse combinatorial optimization problems, where ...