Cutting Plane Algorithms are Exact for Euclidean Max-Sum Problems

Hoa T. Bui, Sandy Spiers, Ryan Loxton

This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconc…