Approximation algorithms for reliable stochastic combinatorial optimization
From MaRDI portal
Recommendations
- Stochastic combinatorial optimization with controllable risk aversion level
- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
- Integer Programming and Combinatorial Optimization
- scientific article; zbMATH DE number 6381764
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
Cited in
(35)- Improved results on the robustness of stochastic approximation algorithms
- Robust combinatorial optimization with knapsack uncertainty
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- A fully polynomial-time approximation scheme for approximating a sum of random variables
- Combinatorial optimization problems with normal random costs
- Robust budget allocation via continuous submodular functions
- Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
- Equilibrium routing under uncertainty
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- The million-variable ``march for stochastic combinatorial optimization
- Approximation algorithms for stochastic combinatorial optimization problems
- scientific article; zbMATH DE number 6381764 (Why is no real title available?)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
- Sub-optimality Approximations
- An FPTAS for optimizing a class of low-rank functions over a polytope
- scientific article; zbMATH DE number 1961527 (Why is no real title available?)
- Approximation algorithms for a class of stochastic selection problems with reward and cost considerations
- A relaxed FPTAS for chance-constrained knapsack
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Risk-averse selfish routing
- Maximizing expected utility for stochastic combinatorial optimization problems
- Min-max-min robust combinatorial optimization
- Correlation robust stochastic optimization
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- Stochastic combinatorial optimization with controllable risk aversion level
- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
- On the correlation gap of matroids
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- A normal fan projection algorithm for low-rank optimization
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Approximating optimization problems in graphs with locational uncertainty
- On the correlation gap of matroids
This page was built for publication: Approximation algorithms for reliable stochastic combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588419)
