Reference : The strength of multi-row models
Scientific journals : Article
Engineering, computing & technology : Computer science
The strength of multi-row models
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 >]
Poirrier, Laurent [University of Waterloo > Department of Optimization and Combinatorics > > >]
Salvagnin, Domenico [University of Padova > Department of Information Engineering > > >]
Mathematical Programming Computation
Yes (verified by ORBi)
[en] Mixed-integer programming ; Multi-ro cutting planes
[en] We develop a method for computing facet-defining valid inequalities for any mixed-integer set PJ. Our practical implementation does not return only facet- defining inequalities, but it is able to find a separating cut whenever one exists. The separator is not comparable in speed with the specific cutting-plane generators used in branch-and-cut solvers, but it is general-purpose. We can thus use it to compute cuts derived from any reasonably small relaxation PJ of a general mixed- integer problem, even when there exists no specific implementation for computing cuts with PJ. Exploiting this, we evaluate, from a computational perspective, the usefulness of cuts derived from several types of multi-row relaxations. In particular, we present results with four different strengthenings of the two-row intersection cut model, and multi-row models with up to fifteen rows. We conclude that only fully-strengthened two-row cuts seem to offer a significant advantage over two-row intersection cuts. Our results also indicate that the improvement obtained by going from models with very few rows to models with up to fifteen rows may not be worth the increased computing cost.

File(s) associated to this reference

Fulltext file(s):

Open access
fetch-paper.pdfAuthor postprint496.34 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.