Fast Clustering Algorithms

DOI10.1287/ijoc.6.2.141zbMath0820.90114MaRDI QIDQ4302716

Ulrich Dorndorf, Erwin Pesch

Publication date: 21 August 1994

Published in: ORSA Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

partitioning; clustering; branch-and-bound; weighted complete graph; cliques of unbounded size

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

A New Composite Algorithm for Clustering Problems, The clique partitioning problem: Facets and patching facets, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, A survey of very large-scale neighborhood search techniques, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, The job shop scheduling problem: Conventional and new solution techniques, Genetic algorithms and tabu search: Hybrids for optimization, TSP ejection chains, Constructing efficient simulated annealing algorithms, Cluster analysis and mathematical programming, Relaxed tours and path ejections for the traveling salesman problem, Flight gate scheduling with respect to a reference schedule, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Metaheuristics: A bibliography, Some computational issues in cluster analysis with no a priori metric, Clustering of microarray data via clique partitioning