Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
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.
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011