Integer programming formulations and efficient local search for relaxed correlation clustering
From MaRDI portal
Publication:2052402
DOI10.1007/S10898-020-00989-7zbMATH Open1481.90278OpenAlexW3133218186MaRDI QIDQ2052402FDOQ2052402
Authors: Eduardo Queiroga, A. Subramanian, Y. Frota, Rosa 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
Recommendations
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- Approximation algorithms for two variants of correlation clustering problem
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- Approximation algorithms for the capacitated correlation clustering problem with penalties
Cites Work
- Signed graphs
- A mathematical bibliography of signed and gain graphs and allied areas
- Correlation clustering
- A branch-and-cut algorithm for partition coloring
- Variable neighborhood search
- The \(r\)-Stirling numbers
- On the asymmetric representatives formulation for the vertex coloring problem
- A simple and effective metaheuristic for the minimum latency problem
- On the solution of a graph partitioning problem under capacity constraints
- Linear and quadratic programming approaches for the general graph partitioning problem
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- An iterated local search heuristic for the split delivery vehicle routing problem
- Cliques, holes and the vertex coloring polytope
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Branch-and-cut approaches for \(p\)-cluster editing
- Partitioning Signed Two-Mode Networks
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
- A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
- Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs
Cited In (4)
- Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- An efficient local search algorithm for correlation clustering on large graphs
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
This page was built for publication: Integer programming formulations and efficient local search for relaxed correlation clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052402)
