Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
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.
Hendrik F. Hamann
InterPACK 2013
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science