The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
From MaRDI portal
Publication:3753315
Recommendations
Cited in
(21)- Exemplar-based clustering via simulated annealing
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- An extension of the \(p\)-median group technology algorithm
- Formation of machine cells and part families in cellular manufacturing systems using a linear assignment algorithm.
- Clustering of objects and attributes for manufacturing and marketing applications
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- A computational study of a nonlinear minsum facility location problem
- An aggregation heuristic for large scale p-median problem
- Optimization problems for machine learning: a survey
- A mixed integer linear model for clustering with variable selection
- A new partitioning around medoids algorithm
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- Affinity propagation and uncapacitated facility location problems
- An efficient Benders decomposition for the \(p\)-median problem
- Integer programming in psychology: a review and directions for future research
- A clustering approach to the planar hub location problem
- The heterogeneous \(p\)-median problem for categorization based clustering
- Title not available (Why is no real title available?)
- Set partition by globally optimized cluster seed points
- Optimal partitioning of a data set based on the \(p\)-median model
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)
