The following pages link to On the rank of disjunctive cuts (Q2884323):
Displaying 12 items.
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- An incremental algorithm for computing ranked full disjunctions (Q882441) (← links)
- Reverse split rank (Q896287) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- Intersection cuts with infinite Split rank (Q2884303) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)