Integer programming formulations and efficient local search for relaxed correlation clustering

DOI10.1007/s10898-020-00989-7zbMath1481.90278OpenAlexW3133218186MaRDI QIDQ2052402

Eduardo Queiroga, Anand Subramanian, Yuri Frota, Rosa M. V. Figueiredo

Publication date: 26 November 2021

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

Full work available at URL: https://doi.org/10.1007/s10898-020-00989-7

zbMATH Keywords

integer programmingunsupervised learningiterated local searchrelaxed correlation clustering

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

Efficient enumeration of the optimal solutions to the correlation clustering problem

Cites Work

• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
• An iterated local search heuristic for the split delivery vehicle routing problem
• Branch-and-cut approaches for \(p\)-cluster editing
• Correlation clustering
• The \(r\)-Stirling numbers
• Cliques, holes and the vertex coloring polytope
• Signed graphs
• Variable neighborhood search
• A mathematical bibliography of signed and gain graphs and allied areas
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• A simple and effective metaheuristic for the minimum latency problem
• Linear and quadratic programming approaches for the general graph partitioning problem
• The maximum balanced subgraph of a signed graph: applications and solution approaches
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
• On the asymmetric representatives formulation for the vertex coloring problem
• A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
• A branch-and-cut algorithm for partition coloring
• On the Solution of a Graph Partitioning Problem under Capacity Constraints
• Partitioning Signed Two-Mode Networks
• Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs

This page was built for publication: Integer programming formulations and efficient local search for relaxed correlation clustering