Sciweavers

92 search results - page 1 / 19
» New heuristics for the maximum diversity problem
Sort
View
HEURISTICS
2007
165views more  HEURISTICS 2007»
13 years 10 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 4 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
EOR
2007
90views more  EOR 2007»
13 years 10 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
HM
2005
Springer
98views Optimization» more  HM 2005»
14 years 4 months ago
A Hybrid GRASP with Data Mining for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
L. F. Santos, Marcos Henrique Ribeiro, Alexandre P...
BIBM
2008
IEEE
134views Bioinformatics» more  BIBM 2008»
14 years 5 months ago
New Approaches to Compare Phylogenetic Search Heuristics
We present new and novel insights into the behavior of two maximum parsimony heuristics for building evolutionary trees of different sizes. First, our results show that the heuris...
Seung-Jin Sul, Suzanne Matthews, Tiffani L. Willia...