The biclique partitioning polytope

DOI10.1016/J.DAM.2021.05.023MaRDI QIDQ2032987zbMATH OpenOpenAlexFDO

Authors Gilberto F. de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucidio dos Anjos F. Cabral, Luiz S. Ochi, Fábio Protti, Rian G. 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

biclique partitioningfacet-inducing inequalitiespolyhedral combinatorics

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• New heuristics for the bicluster editing problem
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
• On bipartite and multipartite clique problems
• Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs

Cites work

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

Cited in

(5)

• New heuristics for the bicluster editing problem
• The bipartite Boolean quadric polytope
• scientific article; zbMATH DE number 1103047 (Why is no real title available?)
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• Finding biclique partitions of co-chordal graphs

This page was built for publication: The biclique partitioning polytope

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