Heuristic algorithms for the maximum diversity problem (Q4398552)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1176684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for the maximum diversity problem |
scientific article; zbMATH DE number 1176684 |
Statements
Heuristic algorithms for the maximum diversity problem (English)
0 references
20 July 1998
0 references
diversity maximization
0 references
heuristic algorithms
0 references
suboptimal solutions
0 references
simulation
0 references
0 references
0 references
0 references
0.8418996930122375
0 references
0.8367696404457092
0 references
0.8301491141319275
0 references
0.8093538284301758
0 references
0.8068821430206299
0 references
Diversity maximization is concerned with selecting a subset of a predetermined number of elements that are as diverse as possible. In recent years, there has been a growing interest in the maximum diversity problem with respect to both solution method and practical application. We propose two constructive and two destructive heuristic algorithms for generating suboptimal solutions of high quality to the problem quickly. The special procedures are tested in a simulation study and the empirical results are subject to a standard statistical analysis.
0 references
