Binary package “liblrs-dev” in ubuntu oracular
package to enumerate vertices and extreme rays (development file)
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.
.
This package contains the optional headers, and a unversioned symlink
to the library, useful for developers.
Source package
Published versions
- liblrs-dev 0.71b-2.1build2 in amd64 (Release)
- liblrs-dev 0.73-2build1 in amd64 (Proposed)
- liblrs-dev 0.73-2build1 in amd64 (Release)
- liblrs-dev 0.71b-2.1build2 in arm64 (Release)
- liblrs-dev 0.73-2build1 in arm64 (Proposed)
- liblrs-dev 0.73-2build1 in arm64 (Release)
- liblrs-dev 0.71b-2.1build2 in armhf (Release)
- liblrs-dev 0.73-2build1 in armhf (Proposed)
- liblrs-dev 0.73-2build1 in armhf (Release)
- liblrs-dev 0.71b-2.1build2 in ppc64el (Release)
- liblrs-dev 0.73-2build1 in ppc64el (Proposed)
- liblrs-dev 0.73-2build1 in ppc64el (Release)
- liblrs-dev 0.71b-2.1build2 in riscv64 (Release)
- liblrs-dev 0.73-2build1 in riscv64 (Proposed)
- liblrs-dev 0.73-2build1 in riscv64 (Release)
- liblrs-dev 0.71b-2.1build2 in s390x (Release)
- liblrs-dev 0.73-2build1 in s390x (Proposed)
- liblrs-dev 0.73-2build1 in s390x (Release)