A data-driven scheme that shrinks the uncertainty set until a robust optimization problem becomes feasible, choosing the set by sample coverage or Wasserstein-based probability.
Theory and applica- tions of robust optimization,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Data-Driven Adjustable Robust Optimization
A data-driven scheme that shrinks the uncertainty set until a robust optimization problem becomes feasible, choosing the set by sample coverage or Wasserstein-based probability.