Cutting Planes Valid Inequalities

When the user wants to strengthen a MIP with cutting planes and valid inequalities — deriving cover, clique, MIR, or Gomory cuts, writing separation routines, and adding them as user cuts or lazy constraints via Gurobi callbacks. Also use when the user mentions "valid inequalities," "cutting planes," "separation problem," "user cuts," "cover inequalities," "subtour elimination," or when a formulation needs exponentially many constraints generated on the fly. For callback mechanics beyond cuts, see gurobi-advanced-features; for formulation tightening, see integer-programming-techniques.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit 23e1835e15

Frequently asked questions

npx get-skill add hajibabaie/cutting-planes-valid-inequalities