Cell-and-bound algorithm for chance constrained programs with discrete distributions
type: Item
instance of: scholarly article
title: Cell-and-bound algorithm for chance constrained programs with discrete distributions
zbMATH Open document ID: 1403.90543
author: Baiyi Wu
author: Xueting Cui
author: X. J. Zheng
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6875780
zbMATH Keywords: global optimization
zbMATH Keywords: chance constrained program
zbMATH Keywords: discrete distribution
zbMATH Keywords: cell enumeration
zbMATH Keywords: polynomially solvable
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.01.046
OpenAlex ID: W2583396165
cites work: Call center staffing with simulation and cutting plane methods
cites work: Reverse search for enumeration
cites work: Network reliability design via joint probabilistic constraints
cites work: Subroutines for computing normal probabilities of sets -- computer experiences
cites work: Q3772828
cites work: Q4198056
cites work: Structural properties of linear probabilistic constraints
cites work: Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints
cites work: Convexity of chance constraints with independent random variables
cites work: A Stochastic Programming Model
cites work: Threshold Boolean form for joint probabilistic constraints with random technology matrix
cites work: The minmax multidimensional knapsack problem with application to a chance‐constrained problem
cites work: On mixing sets arising in chance-constrained programming
cites work: Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
cites work: Solving chance-constrained optimization problems with stochastic quadratic inequalities
cites work: An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
cites work: Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints
cites work: An integer programming approach for linear programs with probabilistic constraints
cites work: Chance Constrained Programming with Joint Constraints
cites work: Convex Approximations of Chance Constrained Programs
cites work: Q5638126
cites work: Contributions to the theory of stochastic programming
cites work: Programming under probabilistic constraints with a random technology matrix
cites work: Q4830009
cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
cites work: Lectures on Stochastic Programming
cites work: On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs
cites work: Q4719331
cites work: Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function
cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
cites work: Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
DOI: 10.1016/J.EJOR.2017.01.046
description: scientific article; zbMATH DE number 6875780