An improved vertex enumeration algorithm (Q1160560)

From MaRDI portal
Revision as of 13:53, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An improved vertex enumeration algorithm
scientific article

    Statements

    title
    An improved vertex enumeration algorithm (English)
    0 references
    author
    L. G. Proll
    0 references
    Martin Dyer
    0 references
    publication date
    1982
    0 references
    zbMATH Keywords
    improved vertex enumeration algorithm
    0 references
    pivoting methods
    0 references
    convex polytope
    0 references
    Dyer-Proll algorithm
    0 references
    implementation strategy
    0 references
    barred pivot strategy
    0 references
    adjacency test
    0 references
    determination of all vertices
    0 references
    search tree labelling
    0 references
    redundant branch removal
    0 references
    algorithmic performance
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C05
    0 references
    52Bxx
    0 references
    65K05
    0 references
    zbMATH DE Number
    3750661
    0 references
    Wikidata QID
    Q56324200
    0 references
    OpenAlex ID
    W2084324684
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1160560&oldid=34663076"
    Powered by MediaWiki