A semidefinite programming-based branch-and-cut algorithm for biclustering

DOI10.1287/IJOC.2024.0683MaRDI QIDQ6857764zbMATH OpenFDO

Authors Antonio M. Sudoso

Publication date 16 February 2026

Published in INFORMS Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

global optimizationsemidefinite programmingbiclusteringbranch-and-cut

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: A semidefinite programming-based branch-and-cut algorithm for biclustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857764)