A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem

DOI10.1287/IJOC.9.1.30MaRDI QIDQ4367040zbMATH OpenOpenAlexFDO

Authors Gintaras Palubeckis

Publication date 25 November 1997

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.9.1.30

zbMATH Keywords

clusteringheuristicsbranch-and-boundedge-weighted graphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• Evaluation of a Branch and Bound Algorithm for Clustering
• scientific article; zbMATH DE number 2231543
• An improved branch-and-bound clustering approach for data partitioning
• A New Branch and Bound Algorithm for the Clique Partitioning Problem

Cited in

(17)

• An improved branch-and-bound clustering approach for data partitioning
• The clique partitioning problem: Facets and patching facets
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• Cluster analysis and mathematical programming
• A branch‐and‐price approach to k‐clustering minimum biclique completion problem
• The biclique partitioning polytope
• Taxicab correspondence analysis
• Evaluation of a Branch and Bound Algorithm for Clustering
• An application of limited branching in clustering
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods
• Box-bisection for solving second-degree systems and the problem of clustering
• An exact algorithm for the two-mode \(KL\)-means partitioning problem
• An Exact Algorithm for Blockmodeling of Two-Mode Network Data
• A parallel branch-and-bound method for cluster analysis
• Optimising sum-of-squares measures for clustering multisets defined over a metric space
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem

This page was built for publication: A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem

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