An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set (Q1344644)
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: An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set |
scientific article; zbMATH DE number 722511
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set |
scientific article; zbMATH DE number 722511 |
Statements
An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set (English)
0 references
13 February 1995
0 references
minimal convex subset
0 references
integer points of a convex polyhedral set
0 references
separating hyperplanes
0 references
0.7953824996948242
0 references
0.788016140460968
0 references
0.7625157833099365
0 references
0.7411786913871765
0 references
