The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 00:48, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable |
scientific article |
Statements
The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (English)
0 references
5 May 1999
0 references
strong \({\mathcal P}\)-enumerability
0 references
computational complexity
0 references
