Integer programming with 2-variable equations and 1-variable inequalities
From MaRDI portal
Publication:987826
DOI10.1016/j.ipl.2009.01.025zbMath1200.90128OpenAlexW1976702040MaRDI QIDQ987826
Gustav Nordh, Timo von Oertzen, Manuel Bodirsky
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.025
Cites Work
- Unnamed Item
- A fast algorithm for solving systems of linear equations with two variables per equation
- A linear algorithm for integer programming in the plane
- Fast multiplication of large numbers
- Fast computation of continued fraction expansions.
- Integer Programming with a Fixed Number of Variables
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- Algorithms for the Solution of Systems of Linear Diophantine Equations
- The complexity of satisfiability problems
This page was built for publication: Integer programming with 2-variable equations and 1-variable inequalities
