Pages that link to "Item:Q2884303"
From MaRDI portal
The following pages link to Intersection cuts with infinite Split rank (Q2884303):
Displaying 16 items.
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Reverse split rank (Q896287) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- On the rank of disjunctive cuts (Q2884323) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- (Q4737523) (← links)
- Multirow Intersection Cuts Based on the Infinity Norm (Q5084619) (← links)
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow (Q5256763) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)