  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.
