New heuristics for the bicluster editing problem

DOI10.1007/s10479-016-2261-xzbMath1377.90105OpenAlexW2460696639MaRDI QIDQ1686528

Luiz Satoru Ochi, Lucidio A. F. Cabral, Fábio Protti, Teobaldo Bulhões, Gilberto F. de Sousa Filho

Publication date: 15 December 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2261-x

zbMATH Keywords

clustering problemmetaheuristicbicluster editing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ Complexity of modification problems for reciprocal best match graphs

Uses Software

• FABIA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Variable neighbourhood search: methods and applications
• Cluster graph modification problems
• Applying modular decomposition to parameterized cluster editing problems
• Improved Algorithms for Bicluster Editing
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• Random Graphs

This page was built for publication: New heuristics for the bicluster editing problem