The reviewed record of science sign in
Pith

arxiv: 2003.05022 · v2 · pith:S43HTQY7 · submitted 2020-03-10 · math.OC

Split cuts in the plane

Amitabh Basu , Michele Conforti , Marco Di Summa , Hongyi Jiang This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:S43HTQY7record.jsonopen to challenge →

classification math.OC
keywords planesplitcutspolynomialalgorithmclosurecuttinginteger
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.