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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:53, 3 February 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
