A cutting-plane approach to mixed 0–1 stochastic integer programs
Authors:
- Claus C. CarøeCCClaus C. Carøe
- Jørgen TindJTJørgen Tind
- 1 September 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 101 (2) , 306-316
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Cutting planes for integer programs with general integer variablesMathematical Programming, 1998
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut FrameworkManagement Science, 1996
- Gomory cuts revisitedOperations Research Letters, 1996
- On the convex hull of the simple integer recourse objective functionAnnals of Operations Research, 1995
- On structure and stability in stochastic programs with random technology matrix and complete integer recourseMathematical Programming, 1995
- Stochastic programming with simple integer recourseMathematical Programming, 1993
- The integer L-shaped method for stochastic integer programs with complete recourseOperations Research Letters, 1993
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic ProgrammingSIAM Journal on Applied Mathematics, 1969