Lifting and separation procedures for the cut polytope
- First Online:
- Cite this article as:
- Bonato, T., Jünger, M., Reinelt, G. et al. Math. Program. (2014) 146: 351. doi:10.1007/s10107-013-0688-2
- 365 Downloads
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.