Branch-and-cut approaches for \(p\)-cluster editing

DOI10.1016/j.dam.2016.10.026zbMath1354.05130OpenAlexW2560364549MaRDI QIDQ505422

Anand Subramanian, Teobaldo Bulhões, Gilberto F. de Sousa Filho, Lucídio dos Anjos F. Cabral

Publication date: 23 January 2017

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

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

zbMATH Keywords

valid inequalitiesbranch-and-cutcluster editing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Conference scheduling: a clustering-based approach ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Integer programming formulations and efficient local search for relaxed correlation clustering

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Mixed-integer linear programming formulations for the software clustering problem
• Exact algorithms for cluster editing: Evaluation and experiments
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
• Correlation clustering
• Cluster editing with locally bounded modifications
• A cutting plane algorithm for a clustering problem
• Automated generation of search tree algorithms for hard graphs modification problems
• Even faster parameterized cluster deletion and cluster editing
• Applying modular decomposition to parameterized cluster editing problems
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• Clustering with qualitative information
• The Multi-parameterized Cluster Editing Problem
• A Golden Ratio Parameterized Algorithm for Cluster Editing
• Grouping Multidimensional Data
• The Cluster Editing Problem: Implementations and Experiments
• Correlation clustering with a fixed number of clusters
• A More Effective Linear Kernelization for Cluster Editing
• Cluster Editing
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Aggregating inconsistent information

This page was built for publication: Branch-and-cut approaches for \(p\)-cluster editing