Thomas R. Puzak, A. Hartstein, et al.
CF 2007
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.
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976