Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Sample Average Approximation Method for Stochastic Discrete Optimization
SIAM Journal on Optimization
Computational Optimization and Applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for clustering problems
Approximation algorithms for clustering problems
Facility location and the analysis of algorithms through factor-revealing programs
Facility location and the analysis of algorithms through factor-revealing programs
Sampling-based Approximation Algorithms for Multi-stage Stochastic
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Mathematical Programming: Series A and B
Approximation Algorithms for Metric Facility Location Problems
SIAM Journal on Computing
Computational complexity of stochastic programming problems
Mathematical Programming: Series A and B
Sampling bounds for stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Mechanism design for stochastic optimization problems
ACM SIGecom Exchanges
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Mathematics of Operations Research
Mathematics of Operations Research
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Optimal online assignment with forecasts
Proceedings of the 11th ACM conference on Electronic commerce
A primal-dual approximation algorithm for the k-level stochastic facility location problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
When LP is the cure for your matching woes: improved bounds for stochastic matchings
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Knapsack problem with probability constraints
Journal of Global Optimization
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
Stochastic vehicle routing with recourse
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Stochastic matching with commitment
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Catch them if you can: how to serve impatient users
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Sample complexity of risk-averse bandit-arm selection
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Discrete Applied Mathematics
| Hi-index | 0.00 |
Stochastic optimization problems attempt to model uncertainty in the data by assuming that the input is specified by a probability distribution. We consider the well-studied paradigm of 2-stage models with recourse: first, given only distributional information about (some of) the data one commits on initial actions, and then once the actual data is realized (according to the distribution), further (recourse) actions can be taken. We show that for a broad class of 2-stage linear models with recourse, one can, for any ε 0, in time polynomial in 1/ε and the size of the input, compute a solution of value within a factor (1+ε) of the optimum, in spite of the fact that exponentially many second-stage scenarios may occur. In conjunction with a suitable rounding scheme, this yields the first approximation algorithms for 2-stage stochastic integer optimization problems where the underlying random data is given by a “black box” and no restrictions are placed on the costs in the two stages. Our rounding approach for stochastic integer programs shows that an approximation algorithm for a deterministic analogue yields, with a small constant-factor loss, provably near-optimal solutions for the stochastic generalization. Among the range of applications, we consider are stochastic versions of the multicommodity flow, set cover, vertex cover, and facility location problems.