Tackling discrete optimization problems by continuous methods

Many NP-hard discrete and combinatorial optimization problems can be formulated with the help of quadratic expressions. These in turn can be linearized by lifting the problem from n-dimensional spac