Bounds for probabilistic integer programming problems

DOI10.1016/S0166-218X(01)00329-8zbMath1173.90488MaRDI QIDQ1850114

Dentcheva, Darinka, Prékopa, András, Ruszczyński, Andrzej

Publication date: 2 December 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

stochastic programming; integer programming; knapsack problem; probabilistic constraint

Mathematics Subject Classification ID

90C10: Integer programming

90C15: Stochastic programming

90C27: Combinatorial optimization

Related Items

About Lagrangian methods in integer optimization, Designing robust emergency medical service via stochastic programming, Beam search heuristic to solve stochastic integer problems under probabilistic constraints

Uses Software

• AMPL

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.