Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes |
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
0 references
0 references
0.8977176
0 references
0.8974381
0 references
0.8898051
0 references
