Probabilistic Partial Set Covering with an Oracle for Chance Constraints
From MaRDI portal
Publication:4629339
DOI10.1137/17M1141576zbMath1414.90250arXiv1708.02505OpenAlexW2919175449WikidataQ90802306 ScholiaQ90802306MaRDI QIDQ4629339
Simge Küçükyavuz, Hao-Hsiang Wu
Publication date: 22 March 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02505
Related Items (10)
A discussion of probability functions and constraints from a variational perspective ⋮ Robust min-max regret covering problems ⋮ State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems ⋮ A polyhedral approach to bisubmodular function minimization ⋮ An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions ⋮ Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Efficient presolving methods for the influence maximization problem ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ An exact cutting plane method for \(k\)-submodular function maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the mixing set with a knapsack constraint
- Decomposition algorithms for two-stage chance-constrained programs
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Mixed-integer bilinear programming problems
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- MIP reformulations of the probabilistic set covering problem
- An integer programming approach for linear programs with probabilistic constraints
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Human sexual contact network as a bipartite graph
- A polyhedral study on chance constrained program with random right-hand side
- A polyhedral study of the static probabilistic lot-sizing problem
- A two-stage stochastic programming approach for influence maximization in social networks
- A probabilistic analysis of the maximal covering location problem
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- On intersection of two mixing sets with applications to joint chance-constrained programs
- On mixing sets arising in chance-constrained programming
- A User's Guide to Measure Theoretic Probability
- Random Graphs and Complex Networks
- Chance-Constrained Binary Packing Problems
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- On the Distribution of the Number of Successes in Independent Trials
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Structure and Function of Complex Networks
- Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
- Reducibility among Combinatorial Problems
- Contributions to the theory of stochastic programming
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Probabilistic Set Covering with Correlations
- On the Number of Successes in Independent Trials
- Computing k-out-of-n System Reliability
This page was built for publication: Probabilistic Partial Set Covering with an Oracle for Chance Constraints
