A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731)
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: A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes |
scientific article; zbMATH DE number 5565966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes |
scientific article; zbMATH DE number 5565966 |
Statements
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (English)
0 references
17 June 2009
0 references
convex polytopes and their dual polytopes
0 references
facetal constraint functions
0 references
adjacency
0 references
segments
0 references
mukkas
0 references
nearest points
0 references
0 references
