COMPUTING VERTICES OF INTEGER PARTITION POLYTOPES
The paper describes a method of generating vertices of the polytopes of integer partitions that was used by the authors to calculate all vertices and support vertices of the partition polytopes for all n ≤ 105 and all knapsack partitions of n ≤ 165. The method avoids generating all partitions of n....
Saved in:
| Main Authors: | A. S. Vroublevski, V. A. Shlyk |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-11-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/178 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computation of Metric Dimension of Certain Subdivided Convex Polytopes
by: S. Imran, et al.
Published: (2022-01-01) -
A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes
by: A. N. Maksimenko
Published: (2016-02-01) -
Path Length-Driven Hypergraph Partitioning: An Integer Programming Approach
by: Julien Rodriguez, et al.
Published: (2023-09-01) -
Some Properties of Metric Polytope Constraints
by: V. A. Bondarenko, et al.
Published: (2014-08-01) -
Gale Duality and the Neighborliness of Random Polytopes. I
by: A. G. Brodskiy
Published: (2015-02-01)