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

DOI10.1287/ijoc.9.1.30zbMath0890.90175OpenAlexW1966531215MaRDI QIDQ4367040

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

heuristicsclusteringbranch-and-boundedge-weighted graphs

Mathematics Subject Classification ID

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

Related Items (9)

The clique partitioning problem: Facets and patching facets ⋮ Cluster analysis and mathematical programming ⋮ Optimising sum-of-squares measures for clustering multisets defined over a metric space ⋮ Taxicab correspondence analysis ⋮ The biclique partitioning polytope ⋮ An exact algorithm for the two-mode \(KL\)-means partitioning problem ⋮ Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem ⋮ An Exact Algorithm for Blockmodeling of Two-Mode Network Data

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