Cell-and-bound algorithm for chance constrained programs with discrete distributions
From MaRDI portal
Recommendations
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A genetic algorithm for chance constrained programming
- On convex probabilistic programming with discrete distributions.
- A polyhedral study on chance constrained program with random right-hand side
- An integer programming and decomposition approach to general chance-constrained mathematical programs
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 3365056 (Why is no real title available?)
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A Stochastic Programming Model
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- An integer programming approach for linear programs with probabilistic constraints
- Call center staffing with simulation and cutting plane methods
- Chance Constrained Programming with Joint Constraints
- Contributions to the theory of stochastic programming
- Convex Approximations of Chance Constrained Programs
- Convexity of chance constraints with independent random variables
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints
- Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Lectures on Stochastic Programming
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
- Network reliability design via joint probabilistic constraints
- On mixing sets arising in chance-constrained programming
- On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs
- Pattern-based modeling and solution of probabilistically constrained optimization problems
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Programming under probabilistic constraints with a random technology matrix
- Reverse search for enumeration
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Structural properties of linear probabilistic constraints
- Subroutines for computing normal probabilities of sets -- computer experiences
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
Cited in
(3)
This page was built for publication: Cell-and-bound algorithm for chance constrained programs with discrete distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753452)
