scientific article; zbMATH DE number 1405787
From MaRDI portal
Publication:4938772
Recommendations
- Efficient algorithms for integer programs with two variables per constraint.
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Algorithms and Computation
- A Fast Algorithm for the Two-Variable Integer Programming Problem
- Lower time bounds for integer programming with two variables
- scientific article; zbMATH DE number 1757949
- Binary integer programs with two variables per inequality
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- On the facets of mixed integer programs with two integer variables and two constraints
Cited in
(12)- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Binary integer programs with two variables per inequality
- A Fast Algorithm for the Two-Variable Integer Programming Problem
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- scientific article; zbMATH DE number 1757949 (Why is no real title available?)
- On integer programming and convolution
- Algorithms and Computation
- Approximating infeasible 2VPI-systems
- A fast algorithm for unbounded monotone integer linear systems with two variables per inequality via graph decomposition
- Efficient algorithms for integer programs with two variables per constraint.
- Applications and efficient algorithms for integer programming problems on monotone constraints
- Integer programming with 2-variable equations and 1-variable inequalities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938772)
