A parallel hybrid metaheuristic for bicluster editing

DOI10.1111/itor.12215zbMath1341.90141OpenAlexW2110114928MaRDI QIDQ2811935

Teobaldo Bulhões, Luiz Satoru Ochi, Fábio Protti, Gilberto F. de Sousa Filho, Lucídio dos Anjos F. Cabral

Publication date: 9 June 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12215

zbMATH Keywords

metaheuristicsGRASPparallelizationbicluster editing problemparallel GRASP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems

Cites Work

• A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
• Correlation clustering
• Variable neighbourhood search: methods and applications
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Parallel evolutionary algorithms can achieve super-linear performance
• Cluster graph modification problems
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• Applying modular decomposition to parameterized cluster editing problems
• A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
• A PARALLEL METAHEURISTIC FRAMEWORK BASED ON HARMONY SEARCH FOR SCHEDULING IN DISTRIBUTED COMPUTING SYSTEMS
• Metaheuristics and Parallelism
• Parallel Strategies for Meta-Heuristics
• Parallel metaheuristics: recent advances and new trends
• Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling