Gérard Cornuéjols, Yanjun Li. Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point. In Quentin Louveaux, Martin Skutella, editors, Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Volume 9682 of Lecture Notes in Computer Science, pages 387-397, Springer, 2016. [doi]
Abstract is missing.