| Article ID: | iaor201689 |
| Volume: | 23 |
| Issue: | 3 |
| Start Page Number: | 409 |
| End Page Number: | 431 |
| Publication Date: | May 2016 |
| Journal: | International Transactions in Operational Research |
| Authors: | Ochi Luiz Satoru, Sousa Filho Gilberto F, Jnior Teobaldo L Bulhes, Cabral Lucdio dos Anjos F, Protti Fbio |
| Keywords: | graphs, heuristics |
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.