t -Linearization for the maximum diversity problem

We apply the t -linearization technique to the maximum diversity problem (MDP) and compare its performance with other well-known linearizations. We lift the t -constraints based on the cardinality restriction, derive valid inequalities for MDP, and show their usefulness to solve the problem within the t -linearization framework. We propose and computationally evaluate a branch-and-bound algorithm on benchmark instances. The algorithm is compared with other exact approaches from the literature.