Fast Clustering Algorithms
From MaRDI portal
Publication:4302716
DOI10.1287/ijoc.6.2.141zbMath0820.90114OpenAlexW2129905653MaRDI QIDQ4302716
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
Related Items (28)
Flight gate assignment and recovery strategies with stochastic arrival and departure times ⋮ Genetic algorithms and tabu search: Hybrids for optimization ⋮ The clique partitioning problem: Facets and patching facets ⋮ A three-phased local search approach for the clique partitioning problem ⋮ A branch-and-bound algorithm for the acyclic partitioning problem ⋮ TSP ejection chains ⋮ Constructing efficient simulated annealing algorithms ⋮ Cluster analysis and mathematical programming ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Metaheuristics: A bibliography ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Fixed set search applied to the clique partitioning problem ⋮ A New Composite Algorithm for Clustering Problems ⋮ Some computational issues in cluster analysis with no a priori metric ⋮ New bounds and constraint propagation techniques for the clique partitioning problem ⋮ Reformulated acyclic partitioning for rail-rail containers transshipment ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Lagrangian relaxation and pegging test for the clique partitioning problem ⋮ Flight gate scheduling with respect to a reference schedule ⋮ A survey of very large-scale neighborhood search techniques ⋮ The biclique partitioning polytope ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Exact algorithms for the minimum \(s\)-club partitioning problem ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem ⋮ Clustering of microarray data via clique partitioning ⋮ Relaxed tours and path ejections for the traveling salesman problem
This page was built for publication: Fast Clustering Algorithms