Chance-constrained set covering with Wasserstein ambiguity
From MaRDI portal
Publication:2687060
DOI10.1007/s10107-022-01788-6OpenAlexW3092147387MaRDI QIDQ2687060
Publication date: 1 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05671
Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Stochastic programming (90C15)
Related Items
On approximations of data-driven chance constrained programs over Wasserstein balls, Distributionally robust chance constrained games under Wasserstein ball, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers
Cites Work
- Unnamed Item
- Unnamed Item
- Data-driven chance constrained stochastic program
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- On the rate of convergence in Wasserstein distance of the empirical measure
- Maximizing a class of submodular utility functions
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- MIP reformulations of the probabilistic set covering problem
- Polymatroids and mean-risk minimization in discrete optimization
- Dynamic versions of set covering type public facility location problems
- Ambiguous risk constraints with moment and unimodality information
- Uncertain convex programs: randomized solutions and confidence levels
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Distributionally robust joint chance constraints with second-order moment information
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Sequence independent lifting in mixed integer programming
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- On distributionally robust chance-constrained linear programs
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- On mixing sets arising in chance-constrained programming
- A simultaneous inventory control and facility location model with stochastic capacity constraints
- Chance-Constrained Binary Packing Problems
- Generalized Chebyshev Bounds via Semidefinite Programming
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- Minimizing a Submodular Function on a Lattice
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints
- Optimization Under Probabilistic Envelope Constraints
- A generalization of the weighted set covering problem
- On Choosing and Bounding Probability Metrics
- Bicriteria Approximation of Chance-Constrained Covering Problems
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Quantifying Distributional Model Risk via Optimal Transport
- Probabilistic Set Covering with Correlations
- Chance Constrained Programming with Joint Constraints
- Convex Approximations of Chance Constrained Programs
- Mixing mixed-integer inequalities
- Distributionally robust chance constraints for non-linear uncertainties
