A note on the 2-circulant inequalities for the max-cut problem

作者：Kaparis Konstantinos^*; Letchford Adam N

来源：Operations Research Letters, 2018, 46(4): 443-447.

DOI：10.1016/j.orl.2018.05.006

• Max-cut problem
• Polyhedral combinatorics
• Branch-and-cut

The max-cut problem is a much-studied ATP-hard combinatorial optimisation problem. Poljak and Turzik found some facet-defining inequalities for this problem, which we call 2-circulant inequalities. Two polynomial-time separation algorithms have been found for these inequalities, but one is very slow and the other is very complicated. We present a third algorithm, which is as fast as the faster of the existing two, but much simpler.

• 出版日期2018-7