Integer programming formulations and efficient local search for relaxed correlation clustering
From MaRDI portal
Publication:2052402
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
- A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
- A branch-and-cut algorithm for partition coloring
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
- A mathematical bibliography of signed and gain graphs and allied areas
- A simple and effective metaheuristic for the minimum latency problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Branch-and-cut approaches for \(p\)-cluster editing
- Cliques, holes and the vertex coloring polytope
- Correlation clustering
- 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
- Linear and quadratic programming approaches for the general graph partitioning problem
- Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs
- On the asymmetric representatives formulation for the vertex coloring problem
- On the solution of a graph partitioning problem under capacity constraints
- Partitioning Signed Two-Mode Networks
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- Signed graphs
- The \(r\)-Stirling numbers
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Variable neighborhood search
Cited in
(4)- Efficient enumeration of the optimal solutions to the correlation clustering problem
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- An efficient local search algorithm for correlation clustering on large graphs
- Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
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)
