Pages that link to "Item:Q1771307"
From MaRDI portal
The following pages link to A linear algorithm for integer programming in the plane (Q1771307):
Displayed 10 items.
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- Convex minization over \(\mathbb Z^2\) (Q631217) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- On minimum integer representations of weighted games (Q2446687) (← links)
- Logahedra: A New Weakly Relational Domain (Q3648708) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- Split Cuts in the Plane (Q5147031) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)