IBM Research Report Lattice-Free Sets, Branching Disjunctions, and Mixed-Integer Programming

[1]  Gérard Cornuéjols,et al.  Maximal Lattice-Free Convex Sets in Linear Subspaces , 2010, Math. Oper. Res..

[2]  Caj Cor Hurkens.  Blowing up convex sets in the plane , 1990 .

[3]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[4]  M. Rudelson.  Distances Between Non-symmetric Convex Bodies and the $$MM^* $$ -estimate , 1998, math/9812010.

[5]  Greg Kuperberg,et al.  From the Mahler Conjecture to Gauss Linking Integrals , 2006, math/0610904.

[6]  L. Lovász,et al.  Covering minima and lattice-point-free convex bodies , 1988 .

[7]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems , 2005, Ann. Oper. Res..

[8]  Robert Weismantel,et al.  Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three , 2010, Math. Oper. Res..

[9]  Suvrajeet Sen,et al.  Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs , 2011, Oper. Res..

[10]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[11]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[12]  Sanjeeb Dash,et al.  On mixed-integer sets with two integer variables , 2011, Oper. Res. Lett..

[13]  Gérard Cornuéjols,et al.  On the rank of mixed 0,1 polyhedra , 2002, Math. Program..

[14]  V. Milman,et al.  New volume ratio properties for convex symmetric bodies in ℝn , 1987 .

[15]  Alberto Del Pia,et al.  On convergence in mixed integer programming , 2012, Math. Program..

[16]  M. Joerg.  k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs , 2008 .

[17]  L. Wolsey,et al.  Cutting Planes form Two Rows of a Simplex Tableau , 2007 .

[18]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[19]  Yanjun Li,et al.  Cook, Kannan and Schrijver's example revisited , 2008, Discret. Optim..

[20]  Sanjeeb Dash,et al.  Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..

[21]  Alexander E. Litvak,et al.  The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces , 1999, Math. Oper. Res..

[22]  Claus-Peter Schnorr,et al.  Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.

[23]  Laurence A. Wolsey,et al.  Two row mixed-integer cuts via lifting , 2010, Math. Program..

[24]  Sanjay Mehrotra,et al.  A disjunctive cutting plane procedure for general mixed-integer linear programs , 2001, Math. Program..