# On memetic search for the max-mean dispersion problem

3 Mar 2015Xiangjing LaiJin-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$ such that the mean dispersion (or distance) among the selected elements is maximized. Being a useful model to formulate several relevant applications, MaxMeanDP is known to be NP-hard and thus computationally difficult... (read more)

PDF Abstract

# Code Add Remove

No code implementations yet. Submit your code now