lrslib 0.42c-1build1 source package in Ubuntu
Changelog
lrslib (0.42c-1build1) raring; urgency=low * Rebuild against libgmp10. -- Colin Watson <email address hidden> Tue, 08 Jan 2013 13:21:36 +0000
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Raring
- Original maintainer:
- David Bremner
- Architectures:
- any
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| lrslib_0.42c.orig.tar.gz | 164.7 KiB | b14327bbb818850ff1466a8c67f19a531a012a9365e22fe514199c7fc62ed02e |
| lrslib_0.42c-1build1.debian.tar.gz | 12.9 KiB | 8779cf53de3628272c6a8378e4769190b912ddf819da295cf7f4bcb35af7de88 |
| lrslib_0.42c-1build1.dsc | 2.0 KiB | 1c349fb5bb562dc20d4b82f980977e31a57bf72fb142d69cc6dfba871b447d3f |
Available diffs
- diff from 0.42c-1 to 0.42c-1build1 (325 bytes)
Binary packages built by this source
- liblrs-dev: No summary available for liblrs-dev in ubuntu saucy.
No description available for liblrs-dev in ubuntu saucy.
- liblrs0d: No summary available for liblrs0d in ubuntu raring.
No description available for liblrs0d in ubuntu raring.
- 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.
