Code and Data Repository for A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
该仓库提供了基于分支切割技术的精确算法BICL-SDP的C++源代码和MATLAB脚本，用于通过k-最密不相交双团准则求解双聚类问题。
BICL-SDP is an exact algorithm, based on the branch-and-cut technique, for solving the biclustering problem through the k -densest-disjoint biclique criterion described in the paper "An SDP-based Branch-and-Cut Algorithm for Biclustering". This repository contains the C++ source code and the MATLAB scripts.