Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs

References

• Adams W. P., Sherali H. D. A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. Ann. Oper. Res. (2005) 140(1):21–47Crossref, Google Scholar
• Andersen K., Louveaux Q., Weismantel R., Wolsey L. A. Inequalities from two rows of a simplex tableau. IPCO '07: Proc. 12th Internat. Conf. Integer Programming Combin. Optim. (2007) (Springer-Verlag, Berlin) 1–15Crossref, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:3–51Crossref, Google Scholar
• Balas E., Perregaard M. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming. Math. Programming (2003) 94(2–3):221–245Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming (1993) 58(1–3):295–324Crossref, Google Scholar
• Bonami P., Biegler L. T., Conn A. R., Cornuéjols G., Grossmann I. E., Laird C. D., Lee J., Lodi A., Margot F., Sawaya N., Wachter A. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. (2008) 5(2):186–204Crossref, Google Scholar
• Cook W., Kannan R., Schrijver A. Chvátal closures for mixed integer programming problems. Math. Programming (1990) 47(1–3):155–174Crossref, Google Scholar
• Cornuéjols G. Valid inequalities for mixed integer linear programs. Math. Programming (2008) 112(1):3–44Crossref, Google Scholar
• Gomory R. E., Graves P., Wolfe P. An algorithm for integer solutions to linear programs. Recent Advances in Mathematical Programming (1963) (McGraw-Hill, New York) 269–302Google Scholar
• Jörg M. k-disjunctive cuts and a finite cutting plane algorithm for general mixed integer linear programs. (2007) . Accessed June 19, 2009, http://arxiv.org/PS_cache/arxiv/pdf/0707/0707.3945v1.pdfGoogle Scholar
• Li Y., Richard J.-P. P. Cook, Kannan and Schrijver's example revisited. Discrete Optim. (2008) 5(4):724–734Crossref, Google Scholar
• Lovász L., Schrijver A. Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optim. (1991) 1(2):166–190Crossref, Google Scholar
• Owen J. H., Mehrotra S. A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Programming (2001) 89(3):437–448Crossref, Google Scholar
• Owen J. H., Mehrotra S. On the value of binary expansions for general mixed-integer programs. Oper. Res. (2002) 50(5):810–819Link, Google Scholar
• Padberg M. W., Van Roy T. J., Wolsey L. A. Valid linear inequalities for fixed charge problems. Oper. Res. (1985) 33(4):842–861Link, Google Scholar
• Perregaard M., Balas E. Generating cuts from multiple-term disjunctions. Proc. 8th Internat. IPCO Conf. Integer Programming Combin. Optim. (2001) (Springer-Verlag, London) 348–360Crossref, Google Scholar
• Sen S., Sherali H. D. On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs. Math. Programming (1985) 31(1):42–56Crossref, Google Scholar
• Sherali H. D., Adams W. P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. (1990) 3(3):411–430Crossref, Google Scholar
• Sherali H. D., Adams W. P. A hierarchy of relaxations and convex hull representations for mixed-integer zero-one programming problems. Discrete Appl. Math. (1994) 52(1):83–106Crossref, Google Scholar
• Sherali H. D., Shetty C. M.Optimization with Disjunctive Constraints (1980) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Van Roy T. J., Wolsey L. A. Valid inequalities and separation for uncapacitated fixed charge networks. Oper. Res. Lett. (1985) 4(3):105–112Crossref, Google Scholar
• Yuan Y., Sen S. Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs. INFORMS J. Comput. (2009) 21(3):480–487Link, Google Scholar