Intersection Cuts with Infinite Split Rank

DOI10.1287/moor.1110.0522zbMath1242.90117arXiv1701.06606OpenAlexW3104899575MaRDI QIDQ2884303

Margot, François, Amitabh Basu, Cornuéjols, Gérard

Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06606

zbMATH Keywords

cutting planesmixed-integer programmingsplit rank

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Characterization of the split closure via geometric lifting, Theoretical challenges towards cutting-plane selection, Reverse split rank, Disjunctive programming and relaxations of polyhedra, Can Cut-Generating Functions Be Good and Efficient?, Relaxations of mixed integer sets from lattice-free polyhedra, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, On the relative strength of different generalizations of split cuts, Intersection cuts for convex mixed integer programs from translated cones, Relaxations of mixed integer sets from lattice-free polyhedra, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow