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.
Split cuts in the plane
Basu A.;Conforti M.;Di Summa M.;
2021
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
published.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Published (publisher's version)
Licenza:
Accesso libero
Dimensione
847.2 kB
Formato
Adobe PDF
|
847.2 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
