Integer programming formulations and efficient local search for relaxed correlation clustering
type: Item
instance of: scholarly article
title: Integer programming formulations and efficient local search for relaxed correlation clustering
zbMATH Open document ID: 1481.90278
author: Eduardo Queiroga
author: A. Subramanian
author: Y. Frota
author: Rosa Figueiredo
published in: Journal of Global Optimization
publication date: 2021-11-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7433944
zbMATH Keywords: relaxed correlation clustering
zbMATH Keywords: unsupervised learning
zbMATH Keywords: integer programming
zbMATH Keywords: iterated local search
MaRDI profile type: Publication
full work available at URL: s10898-020-00989-7
OpenAlex ID: W3133218186
cites work: Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
cites work: Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs
cites work: A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
cites work: Correlation clustering
cites work: On the Solution of a Graph Partitioning Problem under Capacity Constraints
cites work: The \(r\)-Stirling numbers
cites work: Branch-and-cut approaches for \(p\)-cluster editing
cites work: On the asymmetric representatives formulation for the vertex coloring problem
cites work: Cliques, holes and the vertex coloring polytope
cites work: Partitioning Signed Two-Mode Networks
cites work: Linear and quadratic programming approaches for the general graph partitioning problem
cites work: The maximum balanced subgraph of a signed graph: applications and solution approaches
cites work: A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
cites work: A branch-and-cut algorithm for partition coloring
cites work: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
cites work: Variable neighborhood search
cites work: A simple and effective metaheuristic for the minimum latency problem
cites work: An iterated local search heuristic for the split delivery vehicle routing problem
cites work: Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
cites work: Signed graphs
cites work: A mathematical bibliography of signed and gain graphs and allied areas
DOI: 10.1007/S10898-020-00989-7
description: scientific article; zbMATH DE number 7433944