Some efficiently solvable problems over integer partition polytopes

被引：3
|
作者：
Onn, Shmuel [1 ]
Shlyk, Vladimir A. [2 ]
机构：
[1] Technion Israel Inst Technol, IL-32000 Haifa, Israel
[2] Inst Command Engn, Minsk 220118, BELARUS
来源：
DISCRETE APPLIED MATHEMATICS | 2015年 / 180卷
关键词：
Integer partitions; Integer partition polytope; Vertex; Vertex adjacency; Separation problem;
D O I：
10.1016/j.dam.2014.08.015
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The integer partition polytope P-n is the convex hull of all integer partitions of n. We provide a novel extended formulation of P-n, and use it to show that the extremality, adjacency, and separation problems over P-n, can be solved by linear programming without the ellipsoid method. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：135 / 140
页数：6
相关论文
共 50 条
12345