Split cuts in the plane
classification
🧮 math.OC
keywords
planesplitcutspolynomialalgorithmclosurecuttinginteger
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.