Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem

Thumbnail Image
Download
Name

186_2023_Article_835.pdf

Size

781.98 KB

Format

Adobe PDF

Checksum (MD5)

824c1ef0340bc9b5fa7ea59b577625a6

Download all files submitted through automated deposit
art_73002280729556061.zip (513.06 KB)
Author(s)
Belyi, Alexander
•
Sobolevsky, Stanislav
•
Kurbatski, Alexander
•
Ratti, Carlo
Date Issued
September 9, 2023
Publisher
Springer Berlin Heidelberg
Citation
Belyi, Alexander, Sobolevsky, Stanislav, Kurbatski, Alexander and Ratti, Carlo. 2023. "Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem."
Version
Final published version
Abstract
Abstract 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 evaluate our approach on a broad range of random graphs and real-world networks. The proposed approach provided tighter upper bounds and achieved significant convergence speed improvements compared to known alternative methods.
MIT Department
Senseable City Laboratory
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/152407
DOI of Published Version
https://doi.org/10.1007/s00186-023-00835-y
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.