Some efficiently solvable problems over integer partition polytopes

DOI10.1016/j.dam.2014.08.015zbMath1303.05012OpenAlexW1978661177MaRDI QIDQ476314

Vladimir A. Shlyk, Shmuel Onn

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.015

zbMATH Keywords

integer partitionsinteger partition polytopeseparation problemvertex adjacency

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83)

Related Items

Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number ⋮ Extension complexity of formal languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large sparse numerical optimization
• Polyhedral proof methods in combinatorial optimization
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Geometric algorithms and combinatorial optimization.
• Optimal integer partitions
• Polytopes of partitions of numbers
• Polyhedral Characterization of Discrete Dynamic Programming