scientific article; zbMATH DE number 7650071
From MaRDI portal
Publication:5875455
Cites work
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- Boosted sampling
- Convex majorization with an application to the length of critical paths
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- scientific article; zbMATH DE number 6381764 (Why is no real title available?)
- scientific article; zbMATH DE number 5764865 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Integer Programming and Combinatorial Optimization
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
- Maximally dependent random variables
- On the polynomial solvability of distributionally robust k-sum optimization
- On Two-Stage Stochastic Minimum Spanning Trees
- Price of correlations in stochastic optimization
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Risk-averse stochastic optimization: probabilistically-constrained models and algorithms for black-box distributions (extended abstract)
- Risk-averse two-stage stochastic program with distributional ambiguity
- Stochastic combinatorial optimization with controllable risk aversion level
- Theory and applications of robust optimization
- Thresholded Covering Algorithms for Robust and Max-min Optimization
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875455)