ABS algorithms for Diophantine linear equations and integer LP problems
From MaRDI portal
Recommendations
- A class of ABS algorithms for Diophantine linear systems
- Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
- ABS solution of a class of linear integer inequalities and integer LP problems
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- ABS algorithms for linear equations and ABSPACK
Cites work
- A class of ABS algorithms for Diophantine linear systems
- A class of direct methods for linear systems
- A fast method for finding the basis of non-negative solutions to a linear diophantine equation
- A Note on the Linear Diophantine Equation
- ABS algorithms for linear equations and ABSPACK
- ABS algorithms for linear equations and optimization
- An absolute bound for the size of Diophantine \(m\)-tuples
- Exact solution of general integer systems of linear equations
- scientific article; zbMATH DE number 3124073 (Why is no real title available?)
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- On the Diophantine equation \(x^2+q^{2k+1}=y^n\)
- The implicit LX method of the ABS class
Cited in
(6)- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- ABS solution of a class of linear integer inequalities and integer LP problems
- Numerical analysis of integer ABS methods
- A class of ABS algorithms for Diophantine linear systems
- Symmetric and non-symmetric ABS methods for solving Diophantine systems of equations
- Generating the integer null space and conditions for determination of an integer basis using the ABS algorithms
This page was built for publication: ABS algorithms for Diophantine linear equations and integer LP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767373)
