The following pages link to Primal separation algorithms (Q1416099):
Displaying 8 items.
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- The complexity of cover inequality separation (Q1306471) (← links)
- Primal separation for 0/1 polytopes (Q1396830) (← links)
- On the separation of split cuts and related inequalities (Q1411614) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q6589749) (← links)