Pages that link to "Item:Q3858024"
From MaRDI portal
The following pages link to A Polynomial Algorithm for the Two-Variable Integer Programming Problem (Q3858024):
Displayed 14 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- An integral transformation for integer programming problems (Q1062628) (← links)
- A polynomial algorithm for a one machine batching problem (Q1197905) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- Proportionate progress: A notion of fairness in resource allocation (Q1918992) (← links)
- An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling (Q2365172) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)