György E. Révész
Theoretical Computer Science
In this paper, we prove that the Chvätal-Gomory closure of a set obtained as an intersection of a strictly convex body and a rational polyhedron is a polyhedron. Thus, we generalize a result of Schrijver [Schrijver, A. 1980. On cutting planes. Ann. Discrete Math. 9 291-296], which shows that the Chvätal-Gomory closure of a rational polyhedron is a polyhedron. © 2011 INFORMS.
György E. Révész
Theoretical Computer Science
G. Ramalingam
Theoretical Computer Science
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science