Title of article
Hybrid Metaheuristic for Bicluster Editing Problem
Author/Authors
de Sousa Filho، نويسنده , , Gilberto F. and dos Anjos F. Cabral، نويسنده , , Lucidio and Ochi، نويسنده , , Luiz Satoru and Protti، نويسنده , , Fلbio، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
8
From page
35
To page
42
Abstract
The NP-hard Bicluster Editing Problem consists of adding and/or removing at most k edges to make a bipartite graph G = ( V , E ) a vertex-disjoint union of complete bipartite subgraphs. It has applications in the analysis of gene expression data. We propose the metaheuristics GRASP and VNS, and their hybridization, for the Bicluster Editing Problem, as well as a heuristic construction based on intersection neighborhood set.
Keywords
bicluster editing problem , GRASP , VNS
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2012
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455974
Link To Document