Branch-and-price for \(p\)-cluster editing
From MaRDI portal
Publication:2013143
DOI10.1007/s10589-017-9893-xzbMath1376.90067OpenAlexW2580199244MaRDI QIDQ2013143
Anand Subramanian, Gilberto F. Sousa Filho, Teobaldo Bulhões, Lucídio dos Anjos F. Cabral
Publication date: 3 August 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9893-x
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-cut approaches for \(p\)-cluster editing
- Exact algorithms for cluster editing: Evaluation and experiments
- Correlation clustering
- Cluster editing with locally bounded modifications
- The quadratic knapsack problem -- a survey
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- A cutting plane algorithm for a clustering problem
- Variable neighborhood search
- New facets and a branch-and-cut algorithm for the weighted clique 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
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- A Golden Ratio Parameterized Algorithm for Cluster Editing
- The Cluster Editing Problem: Implementations and Experiments
- Correlation clustering with a fixed number of clusters
- A More Effective Linear Kernelization for Cluster Editing
- Reducibility among Combinatorial Problems
- Cluster Editing
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Aggregating inconsistent information
- Efficient algorithms for cluster editing
This page was built for publication: Branch-and-price for \(p\)-cluster editing
