On polytopes with linear rank with respect to generalizations of the split closure

This publication has 13 references indexed in Scilit:

• On t-branch split cuts for mixed-integer programs
  Mathematical Programming, 2012
• On mixed-integer sets with two integer variables
  Operations Research Letters, 2011
• On the knapsack closure of 0-1 Integer Linear Programs
  Electronic Notes in Discrete Mathematics, 2010
• Cook, Kannan and Schrijver’s example revisited
  Discrete Optimization, 2008
• When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
  Mathematics of Operations Research, 2001
• On the Matrix-Cut Rank of Polyhedra
  Mathematics of Operations Research, 2001
• Lower bounds for cutting planes proofs with small coefficients
  The Journal of Symbolic Logic, 1997
• Cones of Matrices and Set-Functions and 0–1 Optimization
  SIAM Journal on Optimization, 1991
• Chvátal closures for mixed integer programming problems
  Mathematical Programming, 1990
• On cutting-plane proofs in combinatorial optimization
  Linear Algebra and its Applications, 1989