Sciweavers

2 search results - page 1 / 1
» Solving Two-Stage Stochastic Steiner Tree Problems by Two-St...
Sort
View
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 5 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...