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
-
On Partition Dimension of Generalized Convex Polytopes
by: Syed Waqas Shah, et al.
Published: (2023-01-01) -
On nonintegral vertices of 3-SAT problem relaxation polytope
by: A. V. Nikolaev
Published: (2010-06-01) -
ON SEQUENCES OF ELEMENTARY TRANSFORMATIONS IN THE INTEGER PARTITIONS LATTICE
by: Vitaly A. Baransky, et al.
Published: (2023-12-01) -
Partitioning the positive integers with higher order recurrences
by: Clark Kimberling
Published: (1991-01-01) -
Computation of the Double Metric Dimension in Convex Polytopes
by: Liying Pan, et al.
Published: (2021-01-01)