IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
From MaRDI portal
Publication:992606
DOI10.1016/j.ejor.2010.04.019zbMath1205.90211OpenAlexW2144187183MaRDI QIDQ992606
Matthew W. Tanner, Lewis Ntaimo
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.04.019
stochastic programmingbranch-and-boundbranch-and-cutchance constraintsirreducibly infeasible subsystem (IIS)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Medical applications (general) (92C50)
Related Items
Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints ⋮ Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements ⋮ Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures ⋮ ON INTEGRATED CHANCE CONSTRAINTS IN ALM FOR PENSION FUNDS ⋮ Design of control strategies to help prevent the spread of COVID-19 pandemic ⋮ Stochastic optimization for vaccine and testing kit allocation for the COVID-19 pandemic ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Chance-Constrained Binary Packing Problems ⋮ Covering Linear Programming with Violations ⋮ Fair allocation of personal protective equipment to health centers during early phases of a pandemic ⋮ A polyhedral study on chance constrained program with random right-hand side ⋮ Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs ⋮ An algorithm for binary linear chance-constrained problems using IIS ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Threshold Boolean form for joint probabilistic constraints with random technology matrix ⋮ A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting ⋮ Literature review: the vaccine supply chain ⋮ A stochastic programming model of vaccine preparation and administration for seasonal influenza interventions ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ Adaptive sampling immune algorithm solving joint chance-constrained programming ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ A linear programming approach for linear programs with probabilistic constraints
Cites Work
- Unnamed Item
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Dual methods for probabilistic optimization problems.
- An integer programming approach for linear programs with probabilistic constraints
- Finding optimal vaccination strategies under parameter uncertainty using stochastic program\-ming
- Sample average approximation method for chance constrained programming: Theory and applications
- Partitioning procedures for solving mixed-variables programming problems
- Irreducibly inconsistent systems of linear inequalities
- Relaxations for probabilistically constrained programs with discrete random variables
- Optimal vaccination strategies for a community of households
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Optimization of a continuous distillation process under random inflow rate.
- A general model for stochastic SIR epidemics with two levels of mixing
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Finding optimal vaccination strategies for pandemic influenza using genetic algorithms
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A Screening Technique for Joint Chance-Constrained Programming for Air-Quality Management
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Identifying Minimally Infeasible Subsystems of Inequalities
- Programming under probabilistic constraints with a random technology matrix
- Introduction to Stochastic Programming
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- A class of stochastic programming decision problems
- Concavity and efficient points of discrete distributions in probabilistic programming.