Tightening simple mixed-integer sets with guaranteed bounds (Q431027): Difference between revisions

This paper shows that using combinatorial disjunctions, that depend on the problem structure, leads to tight, polynomially large formulations for 0/1 knapsack sets and some fixed-charge network flow sets.