An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets

References

• Andersen K., Cornuéjols G., Li Y. Split closure and intersection cuts. Math. Programming Ser. A (2005) 102:457–493Crossref, Google Scholar
• Andersen K., Louveaux Q., Weismantel R. Certificates of linear mixed integer infeasibility. Oper. Res. Lett. (2008) Google Scholar
• Balas E. Intersection cuts—A new type of cutting plane for integer programming. Oper. Res. (1971) 19:19–39Link, Google Scholar
• Balas E. Disjunctive programming. Ann. Discrete Math. (1979) 5:517–546Google Scholar
• Cook W. J., Kannan R., Schrijver A. Chvátal closures for mixed integer programming problems. Math. Programming (1990) 47:155–174Crossref, Google Scholar
• Cornuéjols G. Valid inequalities for mixed integer linear programs. Math. Programming Ser. B (2008) 112:3–44Crossref, Google Scholar
• Lovász L., Iri M., Tanabe K. Geometry of numbers and integer programming. Math. Programming, Recent Developments and Applications (1989) (Kluwer, Dordrecht, The Netherlands) 177–210Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar