Paket: lrslib (0.71b-2)

Länkar för lrslib

Debianresurser:

Hämta källkodspaketet lrslib:

Ansvarig:

David Bremner (QA-sida)

Externa resurser:

Hemsida [cgm.cs.mcgill.ca]

Liknande paket:

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.

Märken: Role: Program

Andra paket besläktade med lrslib

beror

rekommenderar

föreslår

enhances

dep: libc6 (>= 2.17)

GNU C-bibliotek: Delade bibliotek
också ett virtuellt paket som tillhandahålls av libc6-udeb
dep: libgmp10 (>= 2:6.2.1+dfsg)

Multiprecision arithmetic library
dep: liblrs1 (>= 0.71~4641)

package to enumerate vertices and extreme rays (shared libraries)

Hämta lrslib

Hämtningar för alla tillgängliga arkitekturer
Arkitektur	Paketstorlek	Installerad storlek	Filer
arm64	34,0 kbyte	77,0 kbyte	[filförteckning]