The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997): Difference between revisions
From MaRDI portal
Latest revision as of 08:59, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification |
scientific article |
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