Lift-and-project for general two-term disjunctions

DOI10.1016/J.DISOPT.2014.02.001zbMATH Open1308.90207OpenAlexW2034785982MaRDI QIDQ2339813FDOQ2339813

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)

Cites Work

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

Cited In (5)

• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• When Lift-and-Project Cuts Are Different
• On cutting planes for cardinality-constrained linear programs

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)