Name
Abstract | ||
|---|---|---|
The bicluster editing problem (BEP) consists of editing (adding or removing) the edges of a bipartite graph G in order to transform it into a vertex-disjoint union of complete bipartite subgraphs, in such a way that the sum of the weights of the edited edges is minimum. In this paper, we propose five parallel strategies for the implementation of a hybrid metaheuristic for the BEP, consisting of a GRASP with VNS as local search. Computational experiments show near-linear speedups on Linux cluster with 64 processors and better solutions than those of the sequential approach. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1111/itor.12215 | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH |
Keywords | Field | DocType |
bicluster editing problem, metaheuristics, GRASP, parallelization, parallel GRASP | Mathematical optimization,GRASP,Computer science,Bipartite graph,Theoretical computer science,Local search (optimization),Computer cluster,Metaheuristic | Journal |
Volume | Issue | ISSN |
23 | 3 | 0969-6016 |
Citations | PageRank | References |
2 | 0.36 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilberto Farias de Sousa Filho | 1 | 13 | 4.07 |
| teobaldo l bulhoes junior | 2 | 2 | 0.36 |
| Lucídio dos Anjos Formiga Cabral | 3 | 65 | 8.50 |
| Luiz Satoru Ochi | 4 | 474 | 34.62 |
| Fábio Protti | 5 | 357 | 46.14 |