Pages that link to "Item:Q4646443"
From MaRDI portal
The following pages link to Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443):
Displaying 5 items.
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- Intersection cuts with infinite Split rank (Q2884303) (← links)
- On the rank of disjunctive cuts (Q2884323) (← links)