An algorithm for binary linear chance-constrained problems using IIS
From MaRDI portal
Publication:2419523
DOI10.1007/s10589-018-00055-9zbMath1420.90041OpenAlexW2907751462WikidataQ128641235 ScholiaQ128641235MaRDI QIDQ2419523
Bernardo K. Pagnoncelli, Julian A. Gallego, Lewis Ntaimo, Gianpiero Canessa
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-00055-9
Related Items (1)
Cites Work
- On the mixing set with a knapsack constraint
- MIP reformulations of the probabilistic set covering problem
- Multi-objective stochastic programming for portfolio selection
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Mathematical programming approaches for generating \(p\)-efficient points
- Sample average approximation method for chance constrained programming: Theory and applications
- An algorithm for set covering problem
- On mixing sets arising in chance-constrained programming
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Chance-Constrained Binary Packing Problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- Identifying Minimally Infeasible Subsystems of Inequalities
- Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
- 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
- Concavity and efficient points of discrete distributions in probabilistic programming.
This page was built for publication: An algorithm for binary linear chance-constrained problems using IIS
