Skip to content

Author

Juntao Zhao

We have 1 of 9 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Jul 2026

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...

M. Hifi, Y. Salmi, Juntao Zhao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.