On memetic search for the max-mean dispersion problem

Xiangjing Lai, Jin-Kao Hao

Given a set $V$ of $n$ elements and a distance matrix $[d_{ij}{]}_{n\times n}$ among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset $M$ from $V$…