Bounds for probabilistic integer programming problems
Authors:
- Darinka DentchevaDDDarinka Dentcheva
- András PrékopaAPAndrás Prékopa
- Andrzej RuszczyńskiARAndrzej Ruszczyński
- 1 December 2002
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 124 (1-3) , 55-65
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Concavity and efficient points of discrete distributions in probabilistic programmingMathematical Programming, 2000
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- Stochastic vehicle routingEuropean Journal of Operational Research, 1996
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demandsMathematical Programming, 1995
- Relaxations for probabilistically constrained programs with discrete random variablesOperations Research Letters, 1992
- Sharp Bounds on Probabilities Using Linear ProgrammingOperations Research, 1990
- Models and exact solutions for a class of stochastic location-routing problemsEuropean Journal of Operational Research, 1989
- Contributions to the theory of stochastic programmingMathematical Programming, 1973
- Chance Constrained Programming with Joint ConstraintsOperations Research, 1965
- Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating OilManagement Science, 1958