Combinatorial method for solving systems of linear constraints
From MaRDI portal
Publication:2263302
Recommendations
- Compatibility of systems of linear constraints over the set of natural numbers
- Mathematical Foundations of Computer Science 2005
- ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
- scientific article; zbMATH DE number 2086797
- A methodological view of constraint solving
Cites work
- A fast method for finding the basis of non-negative solutions to a linear diophantine equation
- A polynomial algorithm for solving systems of two linear diophantine equations
- Algorithms for solution of systems of linear Diophantine equations in residue fields
- Algorithms for solving systems of linear Diophantine equations in integer domains
- Algorithms for solving systems of linear Diophantine equations in residue rings
- An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers
- Automatic translation of FORTRAN programs to vector form
- Avoiding slack variables in the solving of linear diophantine equations and inequations
- Complexity classifications of Boolean constraint satisfaction problems
- Efficient solution of linear diophantine equations
- Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Solution of the safe problem on (0,1)-matrices
- Solving numerical constraints
Cited in
(4)
This page was built for publication: Combinatorial method for solving systems of linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263302)