scientific article; zbMATH DE number 7650071
From MaRDI portal
Publication:5875455
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.4MaRDI QIDQ5875455
Sahil Singla, D. Ellis Hershkowitz, R. Ravi
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1811.11635
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Price of Correlations in Stochastic Optimization
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- Theory and Applications of Robust Optimization
- Convex majorization with an application to the length of critical paths
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Boosted sampling
- Thresholded Covering Algorithms for Robust and Max-min Optimization
- On Two-Stage Stochastic Minimum Spanning Trees
- Maximally dependent random variables
- On the polynomial solvability of distributionally robust k-sum optimization
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Risk-Averse Two-Stage Stochastic Program with Distributional Ambiguity
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
- Integer Programming and Combinatorial Optimization
- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
This page was built for publication: