Pages that link to "Item:Q1785202"
From MaRDI portal
The following pages link to Aggregation-based cutting-planes for packing and covering integer programs (Q1785202):
Displaying 11 items.
- Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity (Q6136657) (← links)
