No label defined (Q4452916)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2050725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2050725 |
Statements
7 March 2004
0 references
set convexification disjunctive decomposition
0 references
common cut coefficients
0 references
0.836158037185669
0 references
0.783197283744812
0 references
0.7795606851577759
0 references
0.7663386464118958
0 references
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].
0 references