Integer programming with 2-variable equations and 1-variable inequalities

DOI10.1016/J.IPL.2009.01.025MaRDI QIDQ987826zbMATH OpenOpenAlexFDO

Authors Manuel Bodirsky, Gustav Nordh, Timo von Oertzen

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

zbMATH Keywords

algorithms

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Algorithms and Computation
• A linear algorithm for integer programming in the plane
• scientific article; zbMATH DE number 1757949
• scientific article; zbMATH DE number 1405787
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Cites work

• scientific article; zbMATH DE number 1254301 (Why is no real title available?)
• A fast algorithm for solving systems of linear equations with two variables per equation
• A linear algorithm for integer programming in the plane
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• Fast computation of continued fraction expansions.
• Fast multiplication of large numbers
• 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
• The complexity of satisfiability problems

Cited in

(4)

• A linear algorithm for integer programming in the plane
• scientific article; zbMATH DE number 3883605 (Why is no real title available?)
• scientific article; zbMATH DE number 1757949 (Why is no real title available?)
• Lower time bounds for integer programming with two variables

This page was built for publication: Integer programming with 2-variable equations and 1-variable inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987826)