Tarkennettu haku
trixie  ] [  sid  ]
[ Source:  ]

Paketti: liblrs2 (0.73-2 ja muut) [debports]

Links for liblrs2

Screenshot

Debian-palvelut:

Imuroi lähdekoodipaketti :

Ei löytynyt

Ylläpitäjät:

External Resources:

Samankaltaisia paketteja:

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.

Muut pakettiin liblrs2 liittyvät paketit

  • depends
  • recommends
  • suggests
  • enhances

Imuroi liblrs2

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Versio Paketin koko Koko asennettuna Tiedostot
x32 (epävirallinen siirros) 0.73-2+b1 105.5 kt280.0 kt [tiedostoluettelo]