Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Playing games with approximation algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Convex Approximations of Chance Constrained Programs
SIAM Journal on Optimization
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Newton's method for fractional combinatorial optimization
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Commitment under uncertainty: Two-stage stochastic matching problems
Theoretical Computer Science
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
What about wednesday? approximation algorithms for multistage 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
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Risk sensitivity of price of anarchy under uncertainty
Proceedings of the fourteenth ACM conference on Electronic commerce
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F ⊂ {0, 1}n. For these problems we describe a broad class of corresponding stochastic problems where the cost vector W has independent random components, unknown at the time of solution. A natural and important objective that incorporates risk in this stochastic setting is to look for a feasible solution whose stochastic cost has a small tail or a small convex combination of mean and standard deviation. Our models can be equivalently reformulated as nonconvex programs for which no efficient algorithms are known. In this paper, we make progress on these hard problems. Our results are several efficient general-purpose approximation schemes. They use as a black-box (exact or approximate) the solution to the underlying deterministic problem and thus immediately apply to arbitrary combinatorial problems. For example, from an available δ-approximation algorithm to the linear problem, we construct a δ(1 + ε)-approximation algorithm for the stochastic problem, which invokes the linear algorithm only a logarithmic number of times in the problem input (and polynomial in 1/ε), for any desired accuracy level ε 0. The algorithms are based on a geometric analysis of the curvature and approximability of the nonlinear level sets of the objective functions.