A New Composite Algorithm for Clustering Problems

DOI10.1111/J.1475-3995.1996.TB00046.XMaRDI QIDQ4344451zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clusteringnon-convex optimizationcomposite algorithm

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A new approach to solving data clusterization problems
• A new criterion for clustering algorithm
• An approximation algorithm for a problem of cluster analysis
• Exact and approximation algorithms for clustering
• scientific article; zbMATH DE number 1302183
• scientific article; zbMATH DE number 1882434

Cites work

• scientific article; zbMATH DE number 3942804 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• A cutting plane algorithm for a clustering problem
• A user's guide to tabu search
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Cluster Analysis and Mathematical Programming
• Cluster Analysis: An Application of Lagrangian Relaxation
• Cluster analysis. A survey
• Experiments in projection and clustering by simulated annealing
• Fast Clustering Algorithms
• Methods of matrix algebra
• P-Complete Approximation Problems
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Simulated annealing: A tool for operational research
• Tabu Search—Part I
• Tabu Search—Part II
• Weakly bipartite graphs and the max-cut problem

Cited in

(6)

• Some polynomial programming problems solving with a clustering algorithm
• scientific article; zbMATH DE number 1163448 (Why is no real title available?)
• 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)