AbstractIt is shown how to transform the set of all feasible solution to an integer program represented by a system of linear diophantine inequalities into an ‘equivalent’ set represented by a system of linear diophantine equations and congruences. A similar transformation is given, working in the opposite direction (i.e. from a system of equations to a system of inequalities)
We describe a new algorithm for solving a conjunction of linear diophantine equations, inequations a...
We describe through an algebraic and geometrical study, a new method for solving systems of linear d...
The observation that unification under associativity and commutativity reduces to the solution of ce...
AbstractIt is shown how to transform the set of all feasible solution to an integer program represen...
It is shown how the dual of Fourier–Motzkin elimination can be applied to eliminating the constraint...
AbstractIt is shown how the dual of Fourier–Motzkin elimination can be applied to eliminating the co...
An analogous duality theorem to that for Linear Programming is presented for systems of linear congr...
Linear programming (LP) duality is examined in the context of other dualities in mathematics. The ma...
Abstract: Two algorithms for solving Diophantine linear equations and five algorithms for solving Di...
2This version of the thesis was updated in October 2014. The update only concerns the presentation a...
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear ...
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear ...
Dual feasible functions (DFFs) were used with much success to compute bounds for several combinatori...
In this report, we present an algorithm for solving {\em directly} linear Diophantine systems of bot...
AbstractIn this paper, we present an algorithm for solving directly linear Diophantine systems of bo...
We describe a new algorithm for solving a conjunction of linear diophantine equations, inequations a...
We describe through an algebraic and geometrical study, a new method for solving systems of linear d...
The observation that unification under associativity and commutativity reduces to the solution of ce...
AbstractIt is shown how to transform the set of all feasible solution to an integer program represen...
It is shown how the dual of Fourier–Motzkin elimination can be applied to eliminating the constraint...
AbstractIt is shown how the dual of Fourier–Motzkin elimination can be applied to eliminating the co...
An analogous duality theorem to that for Linear Programming is presented for systems of linear congr...
Linear programming (LP) duality is examined in the context of other dualities in mathematics. The ma...
Abstract: Two algorithms for solving Diophantine linear equations and five algorithms for solving Di...
2This version of the thesis was updated in October 2014. The update only concerns the presentation a...
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear ...
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear ...
Dual feasible functions (DFFs) were used with much success to compute bounds for several combinatori...
In this report, we present an algorithm for solving {\em directly} linear Diophantine systems of bot...
AbstractIn this paper, we present an algorithm for solving directly linear Diophantine systems of bo...
We describe a new algorithm for solving a conjunction of linear diophantine equations, inequations a...
We describe through an algebraic and geometrical study, a new method for solving systems of linear d...
The observation that unification under associativity and commutativity reduces to the solution of ce...
DOI
Add to ORKG