Avoiding slack variables in the solving of linear diophantine equations and inequations
From MaRDI portal
Publication:1391934
DOI10.1016/S0304-3975(96)00195-8zbMath0903.11033MaRDI QIDQ1391934
Evelyne Contejean, Farid Ajili
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Linear programming (90C05) Computer solution of Diophantine equations (11Y50) Diophantine inequalities (11D75) Logic programming (68N17) Linear Diophantine equations (11D04)
Related Items
SUBADDITIVE PERIODIC FUNCTIONS AND NUMERICAL SEMIGROUPS ⋮ An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers ⋮ On a transport problem and monoids of non-negative integers ⋮ Verification of bounded Petri nets using integer programming ⋮ Algorithms for solution of systems of linear Diophantine equations in residue fields ⋮ Numerical semigroups in a problem about cost-effective transport ⋮ Combinatorial method for solving systems of linear constraints ⋮ Numerical Semigroups with a Monotonic Apery Set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Unification in abelian semigroups
- Efficient solution of linear diophantine equations
- Constraint satisfaction using constraint logic programming
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
- Solving \(*\)-problems modulo distributivity by a reduction to \(AC1\)- unification
- An efficient incremental algorithm for solving systems of linear diophantine equations
- A Unification Algorithm for Associative-Commutative Functions
- Algorithms for the Solution of Systems of Linear Diophantine Equations
- Minimal solutions of linear diophantine systems : bounds and algorithms
- General solution of systems of linear diophantine equations and inequations
