Split closure and intersection cuts

This publication has 9 references indexed in Scilit:

• Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
  Management Science, 2005
• 18. Mixed-Integer Programming: A Progress Report
  2004
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
  Mathematical Programming, 2003
• On the rank of mixed 0,1 polyhedra
  Mathematical Programming, 2002
• Elementary closures for integer programs
  Operations Research Letters, 2001
• Chvátal closures for mixed integer programming problems
  Mathematical Programming, 1990
• A recursive procedure to generate all cuts for 0–1 mixed integer programs
  Mathematical Programming, 1990
• Disjunctive Programming
  1979
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
  Operations Research, 1971