Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems

DOI10.1016/0167-6377(85)90003-3zbMath0559.90063OpenAlexW2018054752MaRDI QIDQ2265948

David S. Rubin

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90003-3

zbMATH Keywords

computational complexitydiophantine equationspolynomial-time algorithmsequality constrained integer programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear Diophantine equations (11D04)

Cites Work

• Integer Programming with a Fixed Number of Variables
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Unnamed Item

This page was built for publication: Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems