Login / Signup
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.
Gérard Cornuéjols
Yanjun Li
Published in:
IPCO (2016)
Keyphrases
</>
strictly convex
np complete
boundary points
satisfiability problem
np hard
randomly generated
newton method
computational complexity
constraint satisfaction problems
pspace complete
extreme points
evaluation function
conjunctive queries
objective function
object boundaries