The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The C^3 theorem and a D^2 algorithm for large scale stochastic mixed-integer programming: set convexification |
scientific article; zbMATH DE number 2220873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification |
scientific article; zbMATH DE number 2220873 |
Statements
The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (English)
0 references
31 October 2005
0 references
Stochastic Mixed-Integer Programming
0 references
Disjunctive Programming
0 references
Cutting Plane Algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88577795
0 references
0.87076426
0 references
0.8702958
0 references
0.8674591
0 references
0.86355555
0 references
