A New Composite Algorithm for Clustering Problems
From MaRDI portal
Publication:4344451
DOI10.1111/J.1475-3995.1996.TB00046.XzbMATH Open0873.90073OpenAlexW4244764879MaRDI QIDQ4344451FDOQ4344451
Authors: Abdolhamid Torki, Yasutoshi Yajima, Takao Enkawa 
Publication date: 15 July 1997
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1996.tb00046.x
Recommendations
Cites Work
- A user's guide to tabu search
- Title not available (Why is that?)
- Methods of matrix algebra
- Tabu Search—Part I
- P-Complete Approximation Problems
- Cluster Analysis and Mathematical Programming
- Tabu Search—Part II
- A cutting plane algorithm for a clustering problem
- Fast Clustering Algorithms
- Title not available (Why is that?)
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Title not available (Why is that?)
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Cluster Analysis: An Application of Lagrangian Relaxation
- Simulated annealing: A tool for operational research
- Weakly bipartite graphs and the max-cut problem
- Experiments in projection and clustering by simulated annealing
- Cluster analysis. A survey
Cited In (6)
- Some polynomial programming problems solving with a clustering algorithm
- Title not available (Why is that?)
- Extracting clusters from aggregate panel data: a market segmentation study
- A new approach to solving data clusterization problems
- Combinatorial clustering algorithm of quantum-behaved particle swarm optimization and cloud model
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
This page was built for publication: A New Composite Algorithm for Clustering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344451)
