From: Biclustering of gene expression data using reactive greedy randomized adaptive search procedure
Algorithm Greedy_Randomized_Construction(Seed) | |
---|---|
Solution ← Seed | |
Calculate the incremental costs of the elements not included in the current solution | |
Build the candidate list | |
While <termination condition not met> do | |
Build the restricted candidate list (RCL) | |
Select an element s at random from RCL | |
Solution ← Solution ∪ s | |
Recalculate the incremental costs and candidate list | |
End | |
Return Solution | |
End |