Numerically Safe Gomory Mixed-Integer Cuts

References

• Achterberg T. Constraint integer programming. (2007) . Ph.D. thesis, Technische Universität Berlin, BerlinGoogle Scholar
• Achterberg T., Koch T., Martin A. MIPLIB 2003. Oper. Res. Lett. (2006) 34(4):361–372Crossref, Google Scholar
• Applegate D., Bixby R. E., Chvátal V., Cook W.The Traveling Salesman Problem: A Computational Study (2006) (Princeton University Press, Princeton, NJ) Google Scholar
• Applegate D., Cook W., Dash S., Espinoza D. G. Exact solutions to linear programming problems. Oper. Res. Lett. (2007) 35(6):693–699Crossref, Google Scholar
• Balas E., Saxena A. Optimizing over the split closure. Math. Programming (2008) 113(2):219–240Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G., Natraj N. Gomory cuts revisited. Oper. Res. Lett. (1996) 19(1):1–9Crossref, Google Scholar
• Bertsimas D., Weismantel R.Optimization Over Integers (2005) (Dynamic Ideas, Belmont, MA) Google Scholar
• Bixby R. E., Ceria S., McZeal C. M., Savelsbergh M. W. P. An updated mixed integer programming library: MIPLIB 3.0. Optima (1998) 58:12–15Google Scholar
• Bixby R. E., Fenelon M., Gu Z., Rothberg E., Wunderling R., Powell M. J. D., Scholtes S. MIP: Theory and practice—Closing the gap. System Modelling and Optimization: Methods, Theory and Applications (2000) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 19–49Crossref, Google Scholar
• Bixby R. E., Fenelon M., Gu Z., Rothberg E., Wunderling R., Grötschel M. Mixed-integer programming: A progress report. The Sharpest Cut: The Impact of Manfred Padberg and His Work (2004) (SIAM, Philadelphia) 309–325Crossref, Google Scholar
• Cornuéjols G., Li Y., Vandenbussche D. K-Cuts: A variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. (2003) 15(4):385–396Link, Google Scholar
• Dash S., Goycoolea M., Günlük O. Two-step MIR inequalities for mixed-integer programs. INFORMS J. Comput. (2009) . ePub ahead of print August 18, http://dx.doi.org/10.1287/ijoc.1090.0337Google Scholar
• Dash S., Günlük O., Lodi A. MIR closures of polyhedral sets. Math. Programming (2008) . ePub ahead of print May 17Google Scholar
• Espinoza D. On linear programming, integer programming and cutting planes. (2006) . Ph.D. thesis, Georgia Institute of Technology, AtlantaGoogle Scholar
• Goldberg D. What every computer scientist should know about floating-point arithmetic. ACM Comput. Surveys (1991) 23(1):5–48Crossref, Google Scholar
• Gomory R. E. An algorithm for the mixed integer problem. (1960) . Research Memorandum RM-2597, The Rand Corporation, Santa Monica, CAGoogle Scholar
• Goycoolea M. Cutting planes for large mixed integer programming models. (2006) . Ph.D. thesis, Georgia Institute of Technology, AtlantaGoogle Scholar
• IEEE Standard for binary floating point arithmetic. (1985) . ANSI/IEEE Standard 754-1985, Institute of Electrical and Electronics Engineers, Washington, DCGoogle Scholar
• ISO/IEC Programming languages—C. (1999) . Standard ISO/IEC 9899:1999, International Organization for Standardization, GenevaGoogle Scholar
• Marchand M., Wolsey L. A. Aggregation and mixed integer rounding to solve MIPs. Oper. Res. (2001) 49(3):363–371Link, Google Scholar
• Margot F. Testing cut generators for mixed-integer linear programming. Math. Programming Comput. (2009) . ePub ahead of print May 29Crossref, Google Scholar
• Martin G. T. Solving the traveling salesman problem by integer linear programming. (1966) . Technical report, C-E-I-R, New YorkGoogle Scholar
• Miliotis P. Using cutting planes to solve the symmetric travelling salesman problem. Math. Programming (1978) 15(1):177–188Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, New York) Crossref, Google Scholar
• Neumaier A., Shcherbina O. Safe bounds in linear and mixed-integer linear programming. Math. Programming (2004) 99(2):283–296Crossref, Google Scholar
• Reinelt G. TSPLIB—A traveling salesman problem library. ORSA J. Comput. (1991) 3(4):376–384Link, Google Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley & Sons, New York) Google Scholar