A parallel branch-and-bound method for cluster analysis

DOI10.1023/A:1018925018009MaRDI QIDQ1808189zbMATH OpenOpenAlexFDO

Authors Lakshmi S. Iyer, Jay E. Aronson

Publication date 2 December 1999

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018925018009

zbMATH Keywords

cluster analysiscombinatorial optimizationinteger programmingparallel optimization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Evaluation of a Branch and Bound Algorithm for Clustering
• Parallel algorithms for hierarchical clustering
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• Parallel clustering algorithms
• Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
• An improved branch-and-bound clustering approach for data partitioning
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning

Cited in

(6)

• The optimal processor cores' number research for the parallel cluster multiple labeling technique
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• An improved branch-and-bound clustering approach for data partitioning
• Evaluation of a Branch and Bound Algorithm for Clustering
• scientific article; zbMATH DE number 7108501 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)

This page was built for publication: A parallel branch-and-bound method for cluster analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808189)