Split cuts in the plane

  • Amitabh Basu
  • Michele Conforti
  • Marco Di Summa
  • Hongyi Jiang
    • Categories Branch and Cut Algorithms, Cutting Plane Approaches, Polyhedra Tags , Short URL: https://optimization-online.org/?p=16305

    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.

    Article

    Download

    View PDF