Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms

DOI10.1287/ijoc.1080.0284zbMath1243.90120OpenAlexW2023001695MaRDI QIDQ2901054

Jean-Philippe P. Richard, Santanu S. Dey

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.1080.0284

zbMATH Keywords

integer programmingprimal cutting-plane algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (4)

Another pedagogy for pure-integer Gomory ⋮ The strength of multi-row models ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs

This page was built for publication: Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms