Efficient enumeration of the optimal solutions to the correlation clustering problem

DOI10.1007/s10898-023-01270-3zbMath1519.90199arXiv2301.05479OpenAlexW4320881604MaRDI QIDQ6162510

Rosa M. V. Figueiredo, Nejat Arınık, Vincent Labatut

Publication date: 28 June 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.05479

zbMATH Keywords

local searchsigned graphstructural balancecorrelation clusteringenumeration strategyoptimal solution space

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
• A multiple search operator heuristic for the max-k-cut problem
• A survey of very large-scale neighborhood search techniques
• Correlation clustering
• Facets of the clique partitioning polytope
• Fixed-parameter enumerability of cluster editing and related problems
• Balanced decompositions of a signed graph
• A cutting plane algorithm for a clustering problem
• Cliques and clustering: A combinatorial approach
• Integer programming formulations and efficient local search for relaxed correlation clustering
• Network analysis. Methodological foundations.
• Local guarantees in graph cuts and clustering
• Correlation clustering in general weighted graphs
• The feasibility pump
• The clique partitioning problem: Facets and patching facets
• Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Generating Multiple Solutions for Mixed Integer Programming Problems

This page was built for publication: Efficient enumeration of the optimal solutions to the correlation clustering problem