Lift-and-project for general two-term disjunctions

DOI10.1016/J.DISOPT.2014.02.001MaRDI QIDQ2339813zbMATH OpenOpenAlexFDO

Authors Tamás Kis

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.02.001

zbMATH Keywords

disjunctive programminglift-and-project cuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11) Boolean programming (90C09)

Recommendations

• Lift-and-project for mixed 0-1 programming: recent progress
• scientific article; zbMATH DE number 1187158
• Cutting planes from two-term disjunctions
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• scientific article; zbMATH DE number 1757966

Cites work

• scientific article; zbMATH DE number 1187158 (Why is no real title available?)
• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• scientific article; zbMATH DE number 2084778 (Why is no real title available?)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Disjunctive Programming
• Disjunctive programming: Properties of the convex hull of feasible points
• Lift-and-project for mixed 0-1 programming: recent progress
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
• On the Global Solution of Linear Programs with Linear Complementarity Constraints
• Split closure and intersection cuts

Cited in

(6)

• scientific article; zbMATH DE number 1187158 (Why is no real title available?)
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• On cutting planes for cardinality-constrained linear programs
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
• When Lift-and-Project Cuts Are Different

This page was built for publication: Lift-and-project for general two-term disjunctions

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