Branch-and-price for \(p\)-cluster editing
type: Item
instance of: scholarly article
title: Branch-and-price for \(p\)-cluster editing
zbMATH Open document ID: 1376.90067
author: Teobaldo L. Bulhões Júnior
author: A. Subramanian
author: Gilberto F. Sousa Filho
author: Lucidio dos Anjos F. Cabral
published in: Computational Optimization and Applications
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6756291
zbMATH Keywords: cluster editing
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-price
MaRDI profile type: Publication
full work available at URL: s10589-017-9893-x
OpenAlex ID: W2580199244
cites work: Aggregating inconsistent information
cites work: Solving the maximum edge weight clique problem via unconstrained quadratic programming
cites work: Correlation clustering
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Efficient algorithms for cluster editing
cites work: Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
cites work: A Golden Ratio Parameterized Algorithm for Cluster Editing
cites work: Cluster Editing
cites work: Going Weighted: Parameterized Algorithms for Cluster Editing
cites work: Exact algorithms for cluster editing: Evaluation and experiments
cites work: Even faster parameterized cluster deletion and cluster editing
cites work: Branch-and-cut approaches for \(p\)-cluster editing
cites work: Clustering with qualitative information
cites work: Q5850736
cites work: The Cluster Editing Problem: Implementations and Experiments
cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters
cites work: Correlation clustering with a fixed number of clusters
cites work: Q4437501
cites work: Automated generation of search tree algorithms for hard graphs modification problems
cites work: A cutting plane algorithm for a clustering problem
cites work: A More Effective Linear Kernelization for Cluster Editing
cites work: Reducibility among Combinatorial Problems
cites work: Cluster editing with locally bounded modifications
cites work: Variable neighborhood search
cites work: The quadratic knapsack problem -- a survey
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: Q4414513
cites work: New facets and a branch-and-cut algorithm for the weighted clique problem.
DOI: 10.1007/S10589-017-9893-X
description: scientific article; zbMATH DE number 6756291