Linear-programming-based lifting and its application to primal cutting-plane algorithms

DOI10.1287/IJOC.1080.0284MaRDI QIDQ2901054zbMATH OpenOpenAlexFDO

Authors Jean-Philippe 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)

Recommendations

• Primal cutting plane algorithms revisited
• The (not so) trivial lifting in two dimensions
• Valid inequalities for mips and group polyhedra from approximate liftings
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Lifting for conic mixed-integer programming

Cited in

(12)

• Valid inequalities for mips and group polyhedra from approximate liftings
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
• The strength of multi-row models
• Two row mixed-integer cuts via lifting
• Iterated Chvátal-Gomory cuts and the geometry of numbers
• Another pedagogy for pure-integer Gomory
• scientific article; zbMATH DE number 3856814 (Why is no real title available?)
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• Minimizing the influence spread over a network through node interception
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs

This page was built for publication: Linear-programming-based lifting and its application to primal cutting-plane algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901054)