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].











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)