On the MIR Closure of Polyhedra
From MaRDI portal
Publication:5429278
DOI10.1007/978-3-540-72792-7_26zbMath1136.90417OpenAlexW1523191918MaRDI QIDQ5429278
Oktay Günlük, Sanjeeb Dash, Andrea Lodi
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_26
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
MIPping closures: An instant survey, Optimizing over the first Chvátal closure, Bilevel programming and the separation problem, On the relative strength of split, triangle and quadrilateral cuts, A note on the split rank of intersection cuts, A note on the MIR closure, Relaxations of mixed integer sets from lattice-free polyhedra, LP Formulations for Polynomial Optimization Problems, Projected Chvátal-Gomory cuts for mixed integer linear programs, Relaxations of mixed integer sets from lattice-free polyhedra, On the exact separation of mixed integer knapsack cuts, On the separation of disjunctive cuts
