Date: Thu, 28 Mar 2024 15:35:40 +0000 (UTC)
Message-ID: <644112599.207.1711640140260@1a5b09e72cd8>
Subject: Exported From Confluence
MIME-Version: 1.0
Content-Type: multipart/related;
boundary="----=_Part_206_1336057810.1711640140259"
------=_Part_206_1336057810.1711640140259
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
Content-Location: file:///C:/exported.html
Journal Article
Authors: Sandy Spiers, H=
oa T. Bui, Ryan Loxton
Publication
=
arXiv preprint arXiv:2207.10879 (2022).
Quality Indicators
Relevance to the Centre
T=
his paper aims to answer an open question recently posed in the literature,=
that is to find a fast exact method for solving the p-dispersion-sum probl=
em (PDSP), a nonconcave quadratic binary maximization problem. We show that=
, since the Euclidean distance matrix defining the quadratic term in (PDSP)=
is always conditionally negative definite, the cutting plane method is exa=
ct for (PDSP) even in the absence of concavity. As such, the cutting plane =
method, which is primarily designed for concave maximisation problems, conv=
erges to the optimal solution of the (PDSP). The numerical results show tha=
t the method outperforms other exact methods for solving (PDSP), and can so=
lve to optimality large instances of up to two thousand variables.
DOI: 10.48550/arXiv.2207.10879
------=_Part_206_1336057810.1711640140259--