Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints

DOI10.1016/j.orl.2017.08.012zbMath1409.90114OpenAlexW2746501349MaRDI QIDQ1728353

Marc E. Pfetsch, Tobias Fischer

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.08.012

zbMATH Keywords

complementarity constraintsdisjunctive cutsmixed-integer roundingmonoidal cut strengthening

Mathematics Subject Classification ID

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

Related Items

Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, On the structure of linear programs with overlapping cardinality constraints, Recovery under side constraints

Uses Software

• SCIP

Cites Work

• Unnamed Item
• Unnamed Item
• Monoidal cut strengthening revisited
• SCIP: solving constraint integer programs
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• Strengthening cuts for mixed integer programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Branch-and-cut for linear programs with overlapping SOS1 constraints
• Lift-and-project for general two-term disjunctions
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Cutting planes from two-term disjunctions
• Measuring the impact of primal heuristics
• Two row mixed-integer cuts via lifting
• Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
• Integer Programming
• Aggregation and Mixed Integer Rounding to Solve MIPs
• The capacity of wireless networks
• Elementary closures for integer programs.