stable set problem, sums of squares of polynomials, copositive programming, semidefinite programming
Semidefinite programming (msc 90C22), Polyhedral combinatorics, branch-and-bound, branch-and-cut (msc 90C57)
Logistics (theme 3)
Springer
M. Juenger , V. Kaibel
Lecture Notes in Computer Science
Semidefinite programming and combinatorial optimization
International Conference on Integer Programming and Combinatorial Optimization
Networks and Optimization

Gvozdenovic, N, & Laurent, M. (2005). Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. . In M Juenger & V Kaibel (Eds.), Lecture Notes in Computer Science. Springer.