scientific article; zbMATH DE number 2050725
From MaRDI portal
Publication:4452916
The authors illustrated the disjunctive decomposition \((D^2)\) algorithm and the manner which the common cut coefficients \((C^3)\) theorem [\textit{S. Sen} and \textit{J. L. Higle}, The \(C^3\) theorem and \(D^2\) algorithm for large scale stochastic integer programming] is used to reduce the computational effort. There are presented the main results on set convexifications for large scale stochastic integer programming and is given an illustration of the new decomposition method. For the entire collection see [Zbl 1012.00047].
Recommendations
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Decomposition methods in stochastic programming
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
- Dual decomposition in stochastic integer programming
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
Cited in
(5)- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- Fenchel decomposition for stochastic mixed-integer programming
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452916)