The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach

DOI10.1287/MNSC.31.1.84zbMATH Open0612.62086OpenAlexW2155414712MaRDI QIDQ3753315FDOQ3753315

Authors: Theodore D. Klastorin 

Publication date: 1985

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.31.1.84

Recommendations

• Optimal partitioning of a data set based on the \(p\)-median model
• An extension of the \(p\)-median group technology algorithm
• scientific article; zbMATH DE number 4007495
• Exemplar-based clustering via simulated annealing
• Heuristic cluster algorithm for multiple facility location-allocation problem

zbMATH Keywords

cluster analysisp-median problemgeneralized partition comparison measuremixture model approach

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited In (19)

• Formation of machine cells and part families in cellular manufacturing systems using a linear assignment algorithm.
• Optimal partitioning of a data set based on the \(p\)-median model
• Affinity propagation: An exemplar‐based tool for clustering in psychological research
• An iterated greedy heuristic for a market segmentation problem with multiple attributes
• Exemplar-based clustering via simulated annealing
• A new partitioning around medoids algorithm
• Clustering of objects and attributes for manufacturing and marketing applications
• Affinity propagation and uncapacitated facility location problems
• Optimization problems for machine learning: a survey
• Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• The heterogeneous \(p\)-median problem for categorization based clustering
• An efficient Benders decomposition for the \(p\)-median problem
• A clustering approach to the planar hub location problem
• An aggregation heuristic for large scale p-median problem
• An extension of the \(p\)-median group technology algorithm
• A mixed integer linear model for clustering with variable selection
• A computational study of a nonlinear minsum facility location problem
• Set partition by globally optimized cluster seed points

Uses Software

• AS 136

This page was built for publication: The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach

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