Bicriteria approximation of chance-constrained covering problems
Year of publication: |
2020
|
---|---|
Authors: | Xie, Weijun ; Ahmed, Shabbir |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 2, p. 516-533
|
Subject: | programmimg: stochastic, integer | algorithms: heuristic | Optimization | chance-constrained problem | approximation algorithm | distributionally robust optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Stochastischer Prozess | Stochastic process | Robustes Verfahren | Robust statistics |
-
Data-driven optimization with distributionally robust secondorder stochastic dominance constraints
Peng, Chun, (2021)
-
Models and algorithms for stochastic and robust vehicle routing with deadlines
Adulyasak, Yossiri, (2016)
-
An inexact column-and-constraint generation method to solve two-stage robust optimization problems
Tsang, Man Yiu, (2023)
- More ...
-
Distributionally robust simple integer recourse
Xie, Weijun, (2018)
-
Sharing the value‐at‐risk under distributional ambiguity
Chen, Zhi, (2020)
-
Regret in the Newsvendor Model with Demand and Yield Randomness
Chen, Zhi, (2021)
- More ...