Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
From MaRDI portal
Publication:3588419
DOI10.1007/978-3-642-15369-3_26zbMath1306.90111OpenAlexW1506734247MaRDI QIDQ3588419
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_26
stochastic optimizationnonconvex optimizationnonlinear programmingriskapproximation algorithmsmean-riskreliable optimization
Related Items (20)
Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ On the correlation gap of matroids ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Robust combinatorial optimization under budgeted-ellipsoidal uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Polyhedral results for a class of cardinality constrained submodular minimization problems ⋮ Min-max-min robust combinatorial optimization ⋮ Robust budget allocation via continuous submodular functions ⋮ Unnamed Item ⋮ A fully polynomial-time approximation scheme for approximating a sum of random variables ⋮ Risk-Averse Selfish Routing ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Equilibrium routing under uncertainty
This page was built for publication: Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
