Publication date
July 2007
DOIAbstract
An algorithm is given that ascertains whether a linear equation has integer number solutions or not; if it does, the general integer solution is determined
An algorithm is given that ascertains whether a linear equation has integer number solutions or not; if it does, the general integer solution is determined
AbstractThere exist general purpose algorithms to solve the integer linear programming problem but n...
The utility of this article is that it establishes if the number of the natural solutions of a gener...
Let’s consider a polynomial with integer coefficients, of degree m which can be decomposed in linear...
Abtract. Original integer general solutions, together with examples, are presented to solve linear e...
Abtract. Original integer general solutions, together with examples, are presented to solve linear e...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
Abstract: Two algorithms for solving Diophantine linear equations and five algorithms for solving Di...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
The paper describes a method to solve an ILP by describing whether an approximated integer solution ...
AbstractAn algorithm is given for constructing the generalized integer inverse of a matrix. This gen...
Let’s consider a linear system with all coefficients being integer numbers (the case with rational c...
A method to obtain a nonnegative integral solution of a system of linear equations, if such a soluti...
A method to obtain a nonnegative integral solution of a system of linear equations, if such a soluti...
AbstractWe discuss a “binary” algorithm for solving systems of linear equations with integer coeffic...
AbstractThere exist general purpose algorithms to solve the integer linear programming problem but n...
The utility of this article is that it establishes if the number of the natural solutions of a gener...
Let’s consider a polynomial with integer coefficients, of degree m which can be decomposed in linear...
Abtract. Original integer general solutions, together with examples, are presented to solve linear e...
Abtract. Original integer general solutions, together with examples, are presented to solve linear e...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
Abstract: Two algorithms for solving Diophantine linear equations and five algorithms for solving Di...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
The paper describes a method to solve an ILP by describing whether an approximated integer solution ...
AbstractAn algorithm is given for constructing the generalized integer inverse of a matrix. This gen...
Let’s consider a linear system with all coefficients being integer numbers (the case with rational c...
A method to obtain a nonnegative integral solution of a system of linear equations, if such a soluti...
A method to obtain a nonnegative integral solution of a system of linear equations, if such a soluti...
AbstractWe discuss a “binary” algorithm for solving systems of linear equations with integer coeffic...
AbstractThere exist general purpose algorithms to solve the integer linear programming problem but n...
The utility of this article is that it establishes if the number of the natural solutions of a gener...
Let’s consider a polynomial with integer coefficients, of degree m which can be decomposed in linear...
Add to ORKG