lrslib 0.43-1 source package in Ubuntu
Changelog
lrslib (0.43-1) unstable; urgency=low
* New upstream release
* Enable hardening flags
* Update Standards-version to 3.9.4 (no mandatory changes,
debian/copyright syntax tidied.)
-- David Bremner <email address hidden> Sun, 11 Aug 2013 13:42:47 +0200
Upload details
- Uploaded by:
- David Bremner
- Uploaded to:
- Sid
- Original maintainer:
- David Bremner
- Architectures:
- any
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Trusty | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| lrslib_0.43-1.dsc | 1.8 KiB | 7cd5e63b489047c45dc45cb4957d8560254779af64afc41ebcff311fe60f7ba6 |
| lrslib_0.43.orig.tar.gz | 173.2 KiB | 04fc1916ea122b3f2446968d2739717aa2c6c94b21fba1f2c627fd17fcf7a963 |
| lrslib_0.43-1.debian.tar.gz | 13.2 KiB | 58c2bcbf73cc73e178c78342381efb59cc8f2b8c076932fc7e255c174441b164 |
Available diffs
No changes file available.
Binary packages built by this source
- liblrs-dev: package to enumerate vertices and extreme rays (static libraries and headers)
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 static libraries and headers,
useful for developers.
- liblrs0d: package to enumerate vertices and extreme rays (shared libraries)
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 (required) shared library.
- lrslib: package to enumerate vertices and extreme rays of a convex polyhedron
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.
