Text

Split Cuts in the Plane

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.


Read More: https://epubs.siam.org/doi/abs/10.1137/20M1324521

Ketersediaan

Informasi Detail

Judul Seri

SIAM JOURNAL ON OPTIMIZATION; Vol.31 No.1 January-March 2021

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 331 - 347

Bahasa

English

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

INTEGER PROGRAMMING
CUTTING PLANES
SPLIT CUTS

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang

Versi lain/terkait

Lampiran Berkas

Komentar