A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

Antonio M. Sudoso
Antonio M. Sudoso
[email protected]
https://orcid.org/0000-0002-2936-9931
Department of Computer, Control and Management Engineering “Antonio Ruberti,” Sapienza University of Rome, 00185 Rome, Italy
Search for more papers by this author

Antonio M. Sudoso

Antonio M. Sudoso

[email protected]

https://orcid.org/0000-0002-2936-9931

Department of Computer, Control and Management Engineering “Antonio Ruberti,” Sapienza University of Rome, 00185 Rome, Italy

Search for more papers by this author

Published Online:4 Dec 2024https://doi.org/10.1287/ijoc.2024.0683

Supplemental Material

Code and Data: ijoc.2024.0683.cd.zip

cover image INFORMS Journal on Computing

Volume 37, Issue 6

November-December 2025

Pages iii-iv, 1433-1688, ii

Article Information

Supplemental Material

Metrics

Information

Received:March 17, 2024
Accepted:November 07, 2024
Published Online:December 04, 2024

Copyright © 2024, INFORMS

Cite as

Antonio M. Sudoso (2024) A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering. INFORMS Journal on Computing 37(6):1433-1456.

https://doi.org/10.1287/ijoc.2024.0683

Keywords

Acknowledgment

The author thanks Prof. Veronica Piccialli for her valuable suggestions and precious support.