Pages that link to "Item:Q2492682"
From MaRDI portal
The following pages link to Ambiguous chance constrained problems and robust optimization (Q2492682):
Displaying 50 items.
- Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach (Q262915) (← links)
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Data-driven chance constrained stochastic program (Q304243) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Randomized sampling for large zero-sum games (Q490542) (← links)
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
- Robust optimization model for uncertain multiobjective linear programs (Q680878) (← links)
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization (Q707779) (← links)
- Solving chance-constrained combinatorial problems to optimality (Q967213) (← links)
- Stochastic programming approach to optimization under uncertainty (Q995788) (← links)
- Global optimization of robust chance constrained problems (Q1029686) (← links)
- On robust portfolio and naïve diversification: mixing ambiguous and unambiguous assets (Q1621908) (← links)
- Data-driven robust chance constrained problems: a mixture model approach (Q1626548) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- Ambiguous risk constraints with moment and unimodality information (Q1717225) (← links)
- Identifying effective scenarios in distributionally robust stochastic programs with total variation distance (Q1717235) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- Computing near-optimal value-at-risk portfolios using integer programming techniques (Q1754091) (← links)
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations (Q1785197) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- A dynamic game approach to distributionally robust safety specifications for stochastic systems (Q1797093) (← links)
- Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
- On safe tractable approximations of chance constraints (Q1926690) (← links)
- A framework for optimization under ambiguity (Q1931627) (← links)
- Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) (← links)
- Distributionally robust joint chance constraints with second-order moment information (Q1942277) (← links)
- Saddle point approximation approaches for two-stage robust optimization problems (Q2022185) (← links)
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metric (Q2022288) (← links)
- Distributionally robust facility location problem under decision-dependent stochastic demand (Q2030606) (← links)
- Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties (Q2059163) (← links)
- KDE distributionally robust portfolio optimization with higher moment coherent risk (Q2070731) (← links)
- Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
- Bootstrap robust prescriptive analytics (Q2089765) (← links)
- Kernel density estimation based distributionally robust mean-CVaR portfolio optimization (Q2089892) (← links)
- A study of data-driven distributionally robust optimization with incomplete joint data under finite support (Q2098046) (← links)
- Robustness to incorrect models and data-driven learning in average-cost optimal stochastic control (Q2116649) (← links)
- Risk and complexity in scenario optimization (Q2118077) (← links)
- Robust linear classification from limited training data (Q2163210) (← links)
- Frameworks and results in distributionally robust optimization (Q2165596) (← links)
- Partition-based distributionally robust optimization via optimal transport with order cone constraints (Q2168780) (← links)
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets (Q2220666) (← links)
- Wasserstein distributionally robust shortest path problem (Q2301929) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
- Robust linear programming with norm uncertainty (Q2336219) (← links)
- Distributionally robust joint chance constrained problem under moment uncertainty (Q2336465) (← links)
- A distributionally robust perspective on uncertainty quantification and chance constrained programming (Q2349116) (← links)
- Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
- Distributions with maximum spread subject to Wasserstein distance constraints (Q2422610) (← links)
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
- Genetic algorithm based technique for solving chance constrained problems (Q2464197) (← links)
