Two-Step MIR Inequalities for Mixed Integer Programs

DOI10.1287/IJOC.1090.0337zbMath1243.90146OpenAlexW2106068249MaRDI QIDQ2899057

Marcos Goycoolea, Oktay Günlük, Sanjeeb Dash

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1090.0337

zbMATH Keywords

mixed integer programmingroundingpolyhedron separation

Mathematics Subject Classification ID

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

Related Items (9)

Intersection cuts for single row corner relaxations ⋮ MIR closures of polyhedral sets ⋮ Theoretical challenges towards cutting-plane selection ⋮ A heuristic to generate rank-1 GMI cuts ⋮ \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem ⋮ On the strength of Gomory mixed-integer cuts as group cuts ⋮ Facets for continuous multi-mixing set with general coefficients and bounded integer variables ⋮ Relations between facets of low- and high-dimensional group problems ⋮ Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions

Uses Software

• MIPLIB
• FEASPUMP
• MIPLIB2003

This page was built for publication: Two-Step MIR Inequalities for Mixed Integer Programs