Projects / Lattice point Enumeration

Lattice point Enumeration

LattE (Lattice point Enumeration) is 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. LattE was developed in 2002/2003 by a team directed by J.A. De Loera at UC Davis. Current development (since 2006) takes place under the name "LattE macchiato".

Tags
Licenses
Operating Systems
Implementation

Recent releases

  •  05 Jul 2007 07:43

    Release Notes: A build problem on Solaris/SPARC using GCC 4.2.0 was fixed.

    •  17 Sep 2006 19:19

      Release Notes: 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).

      •  17 Sep 2006 19:18

        No changes have been submitted for this release.

        Screenshot

        Project Spotlight

        OpenStack4j

        A Fluent OpenStack client API for Java.

        Screenshot

        Project Spotlight

        TurnKey TWiki Appliance

        A TWiki appliance that is easy to use and lightweight.