On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube |
scientific article |
Statements
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (English)
0 references
14 June 2019
0 references
integer linear programming
0 references
cutting planes
0 references
split cuts
0 references
split closure
0 references
separation
0 references
NP-hardness
0 references
