New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing

DOI10.1007/978-3-540-72792-7_8zbMath1136.90399OpenAlexW1497481553MaRDI QIDQ5429260

Pierre Bonami, Egon Balas

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_8

zbMATH Keywords

integer programmingbranch and cut algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Disjunctive Cuts for Nonconvex MINLP, MIR closures of polyhedral sets, Theoretical challenges towards cutting-plane selection, Optimization Modulo Theories with Linear Rational Costs, Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants, Lift-and-project for general two-term disjunctions

Uses Software

• MIPLIB