Split cuts in the plane

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

doi:10.1137/20M1324521

Split cuts in the plane

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

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

2 Citations (Scopus)

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. © 2021 Society for Industrial and Applied Mathematics

Original language	English
Pages (from-to)	331-347
Journal	SIAM Journal on Optimization
Volume	31
Issue number	1
Online published	21 Jan 2021
DOIs	https://doi.org/10.1137/20M1324521
Publication status	Published - 2021
Externally published	Yes

Research Keywords

Cutting planes
Integer programming
Split cuts

Access Output

10.1137/20M1324521

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{c42446ea64ed4a4abc8f98ec95795b10,

title = "Split cuts in the plane",

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. {\textcopyright} 2021 Society for Industrial and Applied Mathematics",

keywords = "Cutting planes, Integer programming, Split cuts",

author = "Amitabh Basu and Michele Conforti and \{Di Summa\}, Marco and Hongyi Jiang",

year = "2021",

doi = "10.1137/20M1324521",

language = "English",

volume = "31",

pages = "331--347",

journal = "SIAM Journal on Optimization",

issn = "1052-6234",

publisher = "Society for Industrial and Applied Mathematics",

number = "1",

}

TY - JOUR

T1 - Split cuts in the plane

AU - Basu, Amitabh

AU - Conforti, Michele

AU - Di Summa, Marco

AU - Jiang, Hongyi

PY - 2021

Y1 - 2021

N2 - 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. © 2021 Society for Industrial and Applied Mathematics

AB - 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. © 2021 Society for Industrial and Applied Mathematics

KW - Cutting planes

KW - Integer programming

KW - Split cuts

UR - https://www.scopus.com/pages/publications/85103180190

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85103180190&origin=recordpage

U2 - 10.1137/20M1324521

DO - 10.1137/20M1324521

M3 - RGC 21 - Publication in refereed journal

SN - 1052-6234

VL - 31

SP - 331

EP - 347

JO - SIAM Journal on Optimization

JF - SIAM Journal on Optimization

IS - 1

ER -

Split cuts in the plane

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this