Fast 2-variable integer programming
From MaRDI portal
Recommendations
- A Fast Algorithm for the Two-Variable Integer Programming Problem
- Algorithms and Computation
- Fast integer programming in fixed dimension
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Efficient algorithms for integer programs with two variables per constraint.
- Efficient algorithms for integer programs with two variables per constraint. (Extended abstract)
- Lower time bounds for integer programming with two variables
- Integer programming with 2-variable equations and 1-variable inequalities
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Binary integer programs with two variables per inequality
Cited in
(10)- Lower time bounds for integer programming with two variables
- A linear algorithm for integer programming in the plane
- Efficient lattice width computation in arbitrary dimension
- A Fast Algorithm for the Two-Variable Integer Programming Problem
- Efficient algorithms for integer programs with two variables per constraint. (Extended abstract)
- Algorithms and Computation
- Fast integer programming in fixed dimension
- Computing efficiently the lattice width in any dimension
- Lattice angles of lattice polygons
- Integer programming with 2-variable equations and 1-variable inequalities
This page was built for publication: Fast 2-variable integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537737)
