Numerically safe gomory mixed-integer cuts

INFORMS Journal on Computing

Volumn 21, Issue 4, 2009, Pages 641-649

  Cook, William ^a   Dash, Sanjeeb ^b   Fukasawa, Ricardo ^b   Goycoolea, Marcos ^c  

^a Georgia Institute of Technology   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

Author keywords

Cutting plane; Gomory cuts; Integer programming

Indexed keywords

EID: 70449470353     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0324     Document Type: Article

References (27)

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