Reference : Sparse Two-Row Cuts and an Algorithm for the Separation Problem
Scientific congresses and symposiums : Unpublished conference/Abstract
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/122916
Sparse Two-Row Cuts and an Algorithm for the Separation Problem
English
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 >]
Jul-2010
No
Yes
International
Mixed Integer Programming workshop
July 2010
Atlanta
USA
[en] Mixed-integer programming ; Cutting planes
[en] We propose a systematic way to generate sparse cuts from multiple rows of the simplex tableau. We also discuss the question of separation for a multi-row model. To this end, we consideer the polar system allowing to generate valid inequalities. In order to avoid generating the large number of constraints of the polar, we consider a reduced version of it that we dynamically extend. Checking the validity of an inequality is done geometrically. Computational results showing the efficiency of the algorithm are presented. This is a joint work with Laurent Poirrier.
http://hdl.handle.net/2268/122916
http://www2.isye.gatech.edu/mip2010/

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
atlantaQL.pdfAuthor preprint556.87 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.