Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
DOI10.1007/s00186-023-00835-yzbMath1526.05060arXiv2110.05627OpenAlexW3207637137MaRDI QIDQ6080763
No author found.
Publication date: 25 October 2023
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.05627
linear programmingupper boundsexact solutionclusteringbranch-and-boundmodularitycommunity detectionclique partitioning problem
Programming involving graphs or networks (90C35) Clustering in the social and behavioral sciences (91C20) Applications of mathematical programming (90C90) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Computational aspects of data analysis and big data (68T09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-phased local search approach for the clique partitioning problem
- Facets of the clique partitioning polytope
- Solving group technology problems via clique partitioning
- Modularity-maximizing graph communities via mathematical programming
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- A cutting plane algorithm for a clustering problem
- Cliques and clustering: A combinatorial approach
- Solving the clique partitioning problem as a maximally diverse grouping problem
- A novel mixed integer linear programming model for clustering relational networks
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- A branch-and-price procedure for clustering data that are graph connected
- Concise integer linear programming formulation for clique partitioning problems
- Lagrangian relaxation and pegging test for the clique partitioning problem
- Redundant constraints in the standard formulation for the clique partitioning problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Noising methods for a clique partitioning problem
- Fast Clustering Algorithms
- The clique partitioning problem: Facets and patching facets
- Community structure in social and biological networks
- Networks
- Toward Optimal Community Detection: From Trees to General Weighted Networks
- Solving Linear Programs in the Current Matrix Multiplication Time
- Improving Simulated Annealing for Clique Partitioning Problems
- Fast unfolding of communities in large networks
This page was built for publication: Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
