CONVEX HULL OF THE ORTHOGONAL SIMILARITY SET WITH APPLICATIONS IN QUADRATIC ASSIGNMENT PROBLEMS

摘要

In this paper, we study thoroughly the convex hull of the orthogonal similarity set and give a new representation. When applied in quadratic assignment problems, it motivates two new lower bounds. The first is equivalent to the projected eigenvalue bound, while the second highly outperforms several well-known lower bounds in literature.