The biclique partitioning polytope

DOI10.1016/j.dam.2021.05.023zbMath1469.90122OpenAlexW3171807272MaRDI QIDQ2032987

Teobaldo Bulhões, Fábio Protti, Gilberto F. de Sousa Filho, Luiz Satoru Ochi, Lucídio dos Anjos F. Cabral, Rian Gabriel S. Pinheiro

Publication date: 14 June 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.023

zbMATH Keywords

polyhedral combinatoricsfacet-inducing inequalitiesbiclique partitioning

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Finding biclique partitions of co-chordal graphs

Cites Work

• Unnamed Item
• A three-phased local search approach for the clique partitioning problem
• On solving manufacturing cell formation via bicluster editing
• Exact algorithms for cluster editing: Evaluation and experiments
• Correlation clustering
• Facets of the clique partitioning polytope
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• A cutting plane algorithm for a clustering problem
• Lifting theorems and facet characterization for a class of clique partitioning inequalities
• Lagrangian relaxation and pegging test for the clique partitioning problem
• Applying modular decomposition to parameterized cluster editing problems
• Biclique completion problems for multicast network design
• New bounds and constraint propagation techniques for the clique partitioning problem
• Noising methods for a clique partitioning problem
• Grouping Multidimensional Data
• Improved Algorithms for Bicluster Editing
• Fast Clustering Algorithms
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• The clique partitioning problem: Facets and patching facets
• Cluster Editing
• Random Graphs

This page was built for publication: The biclique partitioning polytope