S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
We describe a simple process for generating numerically safe cutting planes using floating-point arithmetic and the mixed-integer rounding procedure. Applying this method to the rows of the simplex tableau permits the generation of Gomory mixed-integer cuts that are guaranteed to be satisfied by all feasible solutions to a mixed-integer programming problem (MIP). We report on tests with the MIPLIB 3.0 and MIPLIB 2003 test collections as well as with MIP instances derived from the TSPLIB traveling salesman library. © 2009 Informs.
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Leo Liberti, James Ostrowski
Journal of Global Optimization
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Raymond Wu, Jie Lu
ITA Conference 2007