VNS variants for the Max-Mean Dispersion Problem

Electronic Notes in Discrete Mathematics, pp. 253-260, 2015.

Cited by: 0|Bibtex|Views2|Links
EI
Keywords:
variable neighborhood searchdiversity problemmax-min dispersion problem

Abstract:

In this paper we propose three different VNS variants to solve the Max-Mean Dispersion Problem. This problem consists of selecting a set of elements in such a way that the average distance between them is maximized. To tackle this problem, we propose a Basic Variable Neighborhood Search (BVNS), a Variable Neighborhood Descent (VND) and a ...More

Code:

Data:

Your rating :
0

 

Tags
Comments