The reformulation–linearization technique (RLT), introduced in [Sherali, H. D., Adams. W. P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3(3), 411–430], provides a way to compute a hierarchy of linear programming bounds on the optimal values of NP-hard combinatorial optimization problems. In this paper we show that, in the presence of suitable algebraic symmetry in the original problem data, it is sometimes possible to compute level two RLT bounds with additional linear matrix inequality constraints. As an illustration of our methodology, we compute the best-known bounds for certain graph partitioning problems on strongly regular graphs.
- reformulation-linearization technique
- Sherali-Adams hierarchy
- quardratic assignment problem
- standard quadratic optimization
- semidefinite programming
de Klerk, E., Nagy, M., Sotirov, R., & Truetsch, U. (2014). Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems. European Journal of Operational Research, 233(3), 488-499. https://doi.org/10.1016/j.ejor.2013.10.007