The Complexity of Vertex Enumeration Methods (Q3313620)

From MaRDI portal
Revision as of 12:44, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The Complexity of Vertex Enumeration Methods
scientific article

    Statements

    title
    The Complexity of Vertex Enumeration Methods (English)
    0 references
    author
    Martin Dyer
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    enumeration of all vertices
    0 references
    computational complexity
    0 references
    convex polyhedron
    0 references
    linear inequalities
    0 references
    vertex enumeration
    0 references

    Identifiers

    DOI
    10.1287/moor.8.3.381
    0 references
    Mathematics Subject Classification ID
    90C05
    0 references
    52Bxx
    0 references
    68Q25
    0 references
    90C08
    0 references
    15A39
    0 references
    zbMATH DE Number
    3843494
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3313620&oldid=16545056"
    Powered by MediaWiki