Integer Programming of Biclustering Based on Graph Models
From MaRDI portal
Publication:3059306
DOI10.1007/978-0-387-89496-6_23zbMath1229.90096OpenAlexW2286052389MaRDI QIDQ3059306
Neng Fan, Altannar Chinchuluun, Panos M. Pardalos
Publication date: 8 December 2010
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-89496-6_23
Related Items (3)
Bi-objective optimization of biclustering with binary data ⋮ Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs ⋮ Linear and quadratic programming approaches for the general graph partitioning problem
This page was built for publication: Integer Programming of Biclustering Based on Graph Models