Pages that link to "Item:Q868448"
From MaRDI portal
The following pages link to Lifting two-integer knapsack inequalities (Q868448):
Displaying 10 items.
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (Q1694325) (← links)
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
- Hybrid heuristics for a short sea inventory routing problem (Q2514744) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
