Lattice point Enumeration 1.2-mk-0.6 (Macchiato) review

Lattice point Enumeration is a computer software dedicated to the problems of counting and detecting lattice points inside convex pol

License: GPL (GNU General Public License) File size: 7098K Developer: Matthias Koeppe

0

Lattice point Enumeration is a computer software dedicated to the problems of counting and detecting lattice points inside convex polytopes, and the solution of integer programs. It contains an implementation of Barvinok's algorithm.

Here are some key features of "Lattice point Enumeration":
Using GNU Autoconf and Automake, it easily builds and runs on a variety of UNIX systems, rather than just on GNU/Linux on the x86 architecture.
Various micro-optimizations and code clean-ups make the code more robust and about 25% faster than LattE.

New algorithms are implemented:

- Primal irrational decomposition
- All-primal irrational decomposition
- Exponential substitution
- Non-unimodular enumeration

A combination of these new algorithms is much faster (for some examples, by several orders of magnitude) than the traditional algorithms implemented in LattE.

What's New in This Release:
Improved portability, using GNU Autoconf and Automake.
New and much faster algorithms: exponential substitution (count --exp), primal irrational decomposition (count --irr), non-unimodular enumeration (count --maxdet=N), and all-primal irrational decomposition (count --all-primal).