摘要: We consider the problem of maximizing a quadratic function on the set {− 1, 1}". This problem is related to some graph partitioning problems. We propose a path following method to compute an upper bound to the previous maximization problem. Numerical implementation of the proposed method and related numerical experience are presented.