Code and Data Repository for A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

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.

Authors

Antonio M. Sudoso (ORCID: https://orcid.org/0000-0002-2936-9931)

Publication Details

Journal: INFORMS journal on computing
Published: 2024-12-04
DOI: https://doi.org/10.1287/ijoc.2024.0683.cd
Primary Topic: Manufacturing Process and Optimization
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Code and Data Repository for A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

Antonio M. Sudoso

Dec 4, 2024

INFORMS journal on computing

Manufacturing Process and Optimization

article

Code and Data Repository for A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

Antonio M. Sudoso

December 4, 2024article en

Abstract

INFORMS journal on computing

Openalex Percentile: Top 66%

Manufacturing Process and Optimization

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Code and Data Repository for A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering — Antonio M. Sudoso · INFORMS journal on computing (2024) | TGRS Research Map | TGRS