A basis enumeration algorithm for linear systems with geometric applications (Q1180318): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Vertex Enumeration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial abstraction of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite crisscross method for oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite conformal-elimination free algorithm over oriented matroid programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finiteness of the criss-cross method / rank
 
Normal rank

Latest revision as of 12:59, 15 May 2024

scientific article
Language Label Description Also known as
English
A basis enumeration algorithm for linear systems with geometric applications
scientific article

    Statements

    A basis enumeration algorithm for linear systems with geometric applications (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    pivot-based algorithm
    0 references
    enumeration of all bases
    0 references
    linear system
    0 references
    convex polyhedron
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references