2023-05-08
Publication
European Journal of Operational Research (2023)
2023
PII: S0377-2217(23)00379-X
DOI: https://doi.org/10.1016/j.ejor.2023.05.014
Reference: EOR 18481
© 2023 Published by Elsevier B.V.
Quality Indicators
Peer Reviewed
Q1 Journal as rated in SJR
Relevance to the Centre
The problem of maximizing diversity and dispersion arises in many practical industry settings.
This paper aims to answer an open question recently posed in the literature, that is to find a fast exact method for solving the max-sum diversity problem, a nonconcave quadratic binary maximization problem. We show that, for Euclidean max-sum diversity problems (EMSDP), the distance matrix defining the quadratic term is always conditionally negative definite. This interesting property ensures that the cutting plane method is exact for (EMSDP), even in the absence of concavity. As such, the cutting plane method, which is primarily designed for concave maximisation problems, converges to the optimal solution of (EMDSP). The method was evaluated on several standard benchmark test sets, where it was shown to outperform other exact solution methods for (EMSDP), and is capable of solving two-coordinate problems of up to eighty-five thousand variables.
