An Efficient Cooperative Scatter Search for the Large-Scale k-Clustering Minimum Biclique Completion Problem
The k-Clustering Minimum Biclique Completion Problem (k-CMBCP) is an NP-hard combinatorial optimization problem with significant implications in bipartite graph clustering applications. The objective is to partition a set of services into k disjoint clusters such that the number of missing edges required to transform e...