Hybrid Metaheuristic for Bicluster Editing Problem
From MaRDI portal
Publication:2840749
DOI10.1016/j.endm.2012.10.006zbMath1268.90167OpenAlexW2075499277MaRDI QIDQ2840749
Lucídio dos Anjos F. Cabral, Gilberto F. de Sousa Filho, Fábio Protti, Luiz Satoru Ochi
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.006
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On solving manufacturing cell formation via bicluster editing ⋮ Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ Complexity of modification problems for reciprocal best match graphs
Cites Work
This page was built for publication: Hybrid Metaheuristic for Bicluster Editing Problem