• Corpus ID: 238634677

Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem

@article{Belyi2021SubnetworkCF,
  title={Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem},
  author={Alexander Belyi and Stanislav Sobolevsky and Alexander N. Kurbatski and Carlo Alberto Ratti},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.05627}
}
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning problem, being NP-hard in the general case of having edge weights of different signs. We propose a new method of estimating an upper bound of the objective function that we combine with the classical branch-and-bound technique to find the exact solution. We… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 46 REFERENCES
Improved upper bounds in clique partitioning problem
In this work, a problem of partitioning a complete weighted graph into cliques in such a way that sum of edge weights between vertices belonging to the same clique is maximal is considered. This
New bounds and constraint propagation techniques for the clique partitioning problem
TLDR
This paper presents tighter upper bounds for each search tree node than those known from the literature, improves the constraint propagation techniques for fixing edges in each node, and presents a new branching scheme.
Fast Clustering Algorithms
TLDR
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized and an ejection chain heuristic is used to compute an initial lower bound.
An Iterated Tabu Search Approach for the Clique Partitioning Problem
TLDR
An iterated tabu search (ITS) algorithm for solving the clique partitioning problem of an edge-weighted undirected graph and performance comparisons against state-of-the-art methods from the literature demonstrate the competitiveness of this approach.
Redundant constraints in the standard formulation for the clique partitioning problem
TLDR
It is confirmed that more than half of the transitivity constraints are redundant for some instances, and that computation times to find an optimal solution are shortened for most instances.
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
TLDR
This paper demonstrates the necessity of cutting planes for this problem and suggests effective ways of adding cutting planes in the branch-and-price framework, and presents computational results on large randomly generated problems.
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
TLDR
This work proposes the first evolutionary algorithm that combines a dedicated merge-divide crossover operator to generate offspring solutions and an effective simulated annealing-based local optimization procedure to find high-quality local optima.
Exact Clustering via Integer Programming and Maximum Satisfiability
TLDR
This study presents a novel integer linear programming (ILP) formulation that has far fewer constraints than the standard ILP formulation by Grötschel and Wakabayashi (1989), and proposes an ILP-based exact algorithm that solves anILP problem obtained by modifying the above ILP formulated and then performs simple post-processing to produce an optimal solution.
Lagrangian relaxation and pegging test for the clique partitioning problem
TLDR
This paper modifications the conventional subgradient method in order to manage the high dimensionality of the Lagrangian multipliers, and makes an improvement on the ordinary pegging test by taking advantage of the structural property of the clique partitions problem.
Toward Optimal Community Detection: From Trees to General Weighted Networks
TLDR
This work investigates the complexity and approximability of the problem on tree graphs and presents a family of compact linear programming formulations for the problem in general graphs, which exploit the graph connectivity structure and reduce substantially the number of constraints.
...
1
2
3
4
5
...