A New Composite Algorithm for Clustering Problems

DOI10.1111/j.1475-3995.1996.tb00046.xzbMath0873.90073OpenAlexW4244764879MaRDI QIDQ4344451

Abdolhamid Torki, Takao Enkawa, Yasutoshi Yajima

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

zbMATH Keywords

clusteringnon-convex optimizationcomposite algorithm

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulated annealing: A tool for operational research
• Experiments in projection and clustering by simulated annealing
• A cutting plane algorithm for a clustering problem
• Weakly bipartite graphs and the max-cut problem
• Cluster analysis. A survey
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• A user's guide to tabu search
• Methods of matrix algebra
• Cluster Analysis: An Application of Lagrangian Relaxation
• Tabu Search—Part I
• Tabu Search—Part II
• P-Complete Approximation Problems
• Fast Clustering Algorithms
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Cluster Analysis and Mathematical Programming

This page was built for publication: A New Composite Algorithm for Clustering Problems