Lagrangian relaxation and pegging test for the clique partitioning problem

DOI10.1007/s11634-013-0135-5zbMath1308.90155OpenAlexW1995548215MaRDI QIDQ2256778

Noriyoshi Sukegawa, Yoshitsugu Yamamoto, Li-Yuan Zhang

Publication date: 23 February 2015

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-013-0135-5

zbMATH Keywords

integer programmingLagrangian relaxationclusteringclique partitioning

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ The biclique partitioning polytope ⋮ A weighted framework for unsupervised ensemble learning based on internal quality measures

Cites Work

• Solving group technology problems via clique partitioning
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Grouping of parts and components in flexible manufacturing systems
• A cutting plane algorithm for a clustering problem
• Conditional subgradient optimization -- theory and applications
• Cliques and clustering: A combinatorial approach
• Consensus of partitions: a constructive approach
• Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
• A pegging approach to the precedence-constrained knapsack problem
• New bounds and constraint propagation techniques for the clique partitioning problem
• Noising methods for a clique partitioning problem
• Clustering of microarray data via clique partitioning
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Fast Clustering Algorithms
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• The clique partitioning problem: Facets and patching facets

This page was built for publication: Lagrangian relaxation and pegging test for the clique partitioning problem