Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185)

From MaRDI portal
Revision as of 09:28, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
scientific article

    Statements

    Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (English)
    0 references
    9 February 2017
    0 references
    NP-complex problem
    0 references
    vertex-facet incidence matrix
    0 references
    combinatorial equivalence
    0 references
    graph of a polytope
    0 references
    graph clique number
    0 references
    extended formulation
    0 references
    cyclic polytope
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references