ABS algorithms for Diophantine linear equations and integer LP problems

DOI10.1007/BF02936043zbMath1138.90427OpenAlexW2007242135MaRDI QIDQ1767373

Zun-Quan Xia, Mei-Feng Zou

Publication date: 10 March 2005

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02936043

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Diophantine equation \(x^2+q^{2k+1}=y^n\)
• A class of direct methods for linear systems
• ABS algorithms for linear equations and optimization
• An absolute bound for the size of Diophantine \(m\)-tuples
• A fast method for finding the basis of non-negative solutions to a linear diophantine equation
• Exact solution of general integer systems of linear equations
• The implicit LX method of the ABS class
• A Note on the Linear Diophantine Equation
• A class of ABS algorithms for Diophantine linear systems

This page was built for publication: ABS algorithms for Diophantine linear equations and integer LP problems