On the complexity of cutting-plane proofs using split cuts (Q969513)
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: On the complexity of cutting-plane proofs using split cuts |
scientific article; zbMATH DE number 5705343
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of cutting-plane proofs using split cuts |
scientific article; zbMATH DE number 5705343 |
Statements
On the complexity of cutting-plane proofs using split cuts (English)
0 references
7 May 2010
0 references
cutting-plane proof
0 references
split cut
0 references
mixed-integer rounding
0 references
monotone interpolation
0 references
0.96464753
0 references
0.91642505
0 references
0 references
0.90337247
0 references
0.8929652
0 references
0.8872039
0 references
0.8857902
0 references
