On memetic search for the max-mean dispersion problem


Given a set V of n elements and a distance matrix [dij ]n×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… (More)

5 Figures and Tables


  • Presentations referencing similar topics