
doi: 10.1111/itor.12215
AbstractThe bicluster editing problem (BEP) consists of editing (adding or removing) the edges of a bipartite graphGin 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.
metaheuristics, bicluster editing problem, parallelization, GRASP, Programming involving graphs or networks, parallel GRASP, Approximation methods and heuristics in mathematical programming
metaheuristics, bicluster editing problem, parallelization, GRASP, Programming involving graphs or networks, parallel GRASP, Approximation methods and heuristics in mathematical programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
