Fast Clustering Algorithms

DOI10.1287/IJOC.6.2.141MaRDI QIDQ4302716zbMATH OpenOpenAlexFDO

Authors 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

branch-and-boundcliques of unbounded sizeclusteringpartitioningweighted complete graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A fast algorithm for the maximum weight clique problem
• scientific article; zbMATH DE number 4007495
• A cutting plane algorithm for a clustering problem
• A fast algorithm for the maximum clique problem
• New bounds and constraint propagation techniques for the clique partitioning problem

Cited in

(42)

• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• A cutting plane algorithm for a clustering problem
• Cliques and clustering: A combinatorial approach
• 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
• Fast algorithms for complete linkage clustering
• Relaxed tours and path ejections for the traveling salesman problem
• Reformulated acyclic partitioning for rail-rail containers transshipment
• 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
• A polynomial algorithm for balanced clustering via graph partitioning
• The biclique partitioning polytope
• Lagrangian relaxation and pegging test for the clique partitioning problem
• Exact algorithms for the minimum \(s\)-club partitioning problem
• Flight gate assignment and recovery strategies with stochastic arrival and departure times
• New bounds and constraint propagation techniques for the clique partitioning problem
• Clustering of microarray data via clique partitioning
• Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
• A three-phased local search approach for the clique partitioning problem
• An improved branch-and-bound clustering approach for data partitioning
• scientific article; zbMATH DE number 5006749 (Why is no real title available?)
• A branch-and-bound algorithm for the acyclic partitioning problem
• An Efficient Clustering Algorithm
• A New Composite Algorithm for Clustering Problems
• The clique partitioning problem: Facets and patching facets
• Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
• Discovery Science
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• Fixed set search applied to the clique partitioning problem
• Mixed integer linear programming formulation for K-means clustering problem
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
• A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning
• A bisection method for solving distance-based clustering problems globally
• An efficient iterated local search for the minimum quasi-clique partitioning problem
• A survey of very large-scale neighborhood search techniques

This page was built for publication: Fast Clustering Algorithms

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