Split Cuts In The Plane

Basu Amitabh,Conforti Michele,Di Summa Marco,Jiang Hongyi

SIAM JOURNAL ON OPTIMIZATION（2021）

引用 5|浏览40

暂无评分

摘要

We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.

查看译文

关键词

integer programming, cutting planes, split cuts

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要