Theory of linear and integer programming
Theory of linear and integer programming
Enumerative combinatorics
Minimal solutions of linear diophantine systems: bounds and algorithms
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
AC-unification race: the system solving approach, implementation and benchmarks
Journal of Symbolic Computation
An efficient incremental algorithm for solving systems of linear Diophantine equations
Information and Computation
A geometric Buchberger algorithm for integer programming
Mathematics of Operations Research
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
From Elliott-MacMahon to an Algorithm for General Linear Constraints on Naturals
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Multi-break rearrangements and chromosomal evolution
Theoretical Computer Science
Basis of solutions for a system of linear inequalities in integers: computation and applications
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |
The ways of using the Elliot-MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well as finite.