The Complexity of Vertex Enumeration Methods (Q3313620): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.8.3.381 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991287453 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Vertex Enumeration Methods |
scientific article |
Statements
The Complexity of Vertex Enumeration Methods (English)
0 references
1983
0 references
enumeration of all vertices
0 references
computational complexity
0 references
convex polyhedron
0 references
linear inequalities
0 references
vertex enumeration
0 references
