Bounds for probabilistic integer programming problems
From MaRDI portal
Publication:1850114
DOI10.1016/S0166-218X(01)00329-8zbMath1173.90488MaRDI QIDQ1850114
Dentcheva, Darinka, Ruszczyński, Andrzej, Prékopa, András
Publication date: 2 December 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
A multi-step rolled forward chance-constrained model and a proactive dynamic approach for the wheat crop quality control problem ⋮ Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems ⋮ Chance constrained unit commitment approximation under stochastic wind energy ⋮ Easy distributions for combinatorial optimization problems with probabilistic constraints ⋮ Augmented Lagrangian method for probabilistic optimization ⋮ Regularization methods for optimization problems with probabilistic constraints ⋮ An exact approach for solving integer problems under probabilistic constraints with random technology matrix ⋮ Log-concavity of compound distributions with applications in stochastic optimization ⋮ Shared mobility systems: an updated survey ⋮ Stochastic 0-1 linear programming under limited distributional information ⋮ Convexity of chance constrained programming problems with respect to a new generalized concavity notion ⋮ Beam search heuristic to solve stochastic integer problems under probabilistic constraints ⋮ Mathematical programming approaches for generating \(p\)-efficient points ⋮ Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables ⋮ Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ Designing robust emergency medical service via stochastic programming ⋮ About Lagrangian methods in integer optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Models and exact solutions for a class of stochastic location-routing problems
- Relaxations for probabilistically constrained programs with discrete random variables
- Stochastic vehicle routing
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Sharp Bounds on Probabilities Using Linear Programming
- Boole-Bonferroni Inequalities and Linear Programming
- Introduction to Stochastic Programming
- 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
- Chance Constrained Programming with Joint Constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
