cut polytope, semidefinite programming
Semidefinite programming (msc 90C22), Polyhedral combinatorics, branch-and-bound, branch-and-cut (msc 90C57)
Logistics (theme 3)
INFORMS
Mathematics of Operations Research
Semidefinite programming and combinatorial optimization
Networks and Optimization

Laurent, M. (2003). Lower bound for the number of iterations in semidefinite relaxations for the cut polytope. . Mathematics of Operations Research, 28(4), 871–883.