Automating cutting planes is NP-hard (Q5144898)
From MaRDI portal
scientific article; zbMATH DE number 7298231
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automating cutting planes is NP-hard |
scientific article; zbMATH DE number 7298231 |
Statements
Automating cutting planes is NP-hard (English)
0 references
19 January 2021
0 references
automatability
0 references
cutting planes
0 references
lifting theorems
0 references
proof complexity
0 references
