Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point |
scientific article |
Statements
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (English)
0 references
10 August 2016
0 references
integer programming
0 references
Gomory-Chvátal cuts
0 references
Gomory-Chvátal closure
0 references
integer hull
0 references
computational complexity
0 references
