| Article ID: | iaor20123360 |
| Volume: | 40 |
| Issue: | 3 |
| Start Page Number: | 149 |
| End Page Number: | 152 |
| Publication Date: | May 2012 |
| Journal: | Operations Research Letters |
| Authors: | Letchford Adam N, Kaparis Konstantinos, Galli Laura |
| Keywords: | max-cut problem |
We prove several complexity results about the gap inequalities for the max‐cut problem, including (i) the gap‐1 inequalities do not imply the other gap inequalities, unless