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… Click to show full abstract
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.
Keywords:
cut algorithm;
based branch;
branch cut
Journal Title: INFORMS Journal on Computing
Year Published: 2024
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: INFORMS Journal on Computing
Year Published: 2024
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!