Details

Autor(en) / Beteiligte

• Bonato, Thorsten
• Jünger, Michael
• Reinelt, Gerhard
• Rinaldi, Giovanni

Titel

Lifting and separation procedures for the cut polytope

Ist Teil von

• Mathematical programming, 2014-08, Vol.146 (1-2), p.351-378

Ort / Verlag

Berlin/Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2014

Link zum Volltext

Quelle

Business Source Ultimate

Beschreibungen/Notizen

• The max-cut problem and the associated cut polytope on complete graphs have been extensively studied over the last 25 years. However, in comparison, only little research has been conducted for the cut polytope on arbitrary graphs, in particular separation algorithms have received only little attention. In this study we describe new separation and lifting procedures for the cut polytope on general graphs. These procedures exploit algorithmic and structural results known for the cut polytope on complete graphs to generate valid, and sometimes facet defining, inequalities for the cut polytope on arbitrary graphs in a cutting plane framework. We report computational results on a set of well-established benchmark problems.