Some efficiently solvable problems over integer partition polytopes (Q476314)
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: Some efficiently solvable problems over integer partition polytopes |
scientific article; zbMATH DE number 6375315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some efficiently solvable problems over integer partition polytopes |
scientific article; zbMATH DE number 6375315 |
Statements
Some efficiently solvable problems over integer partition polytopes (English)
0 references
28 November 2014
0 references
integer partitions
0 references
integer partition polytope
0 references
vertex adjacency
0 references
separation problem
0 references
0.7851161360740662
0 references
0.7840403914451599
0 references
0.776854395866394
0 references
0.776854395866394
0 references
0.775367021560669
0 references
