Reference : Split rank of two-row cuts
Scientific congresses and symposiums : Unpublished conference/Abstract
Engineering, computing & technology : Computer science
Split rank of two-row cuts
Louveaux, Quentin mailto [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Système et modélisation : Optimisation discrète >]
Workshop on multi-row cuts
December 2009
[en] Mixed-integer programming ; Cutting planes
[en] A simple relaxation consisting of two rows of a simplex tableau is a mixed-integer set with two equations, two free integer variables, and nonnegative continuous variables. Recently, Andersen et al. and Cornuéjols and Margot showed that the facet- defining inequalities of this set are either split cuts or intersection cuts obtained from lattice-free triangles and quadrilaterals. From an example given by Cook et al. it is known that one particular class of facet-defining triangle inequality does not have finite split rank. In this paper we show that all other facet-defining triangle and quadrilateral inequalities have finite split rank.

File(s) associated to this reference

Fulltext file(s):

Open access
bertinoro.pdfAuthor preprint716.48 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.