Optimal partitioning of a data set based on the p-median model
DOI10.1007/S11336-007-9021-4zbMATH Open1143.62035OpenAlexW2056223092MaRDI QIDQ946677FDOQ946677
Authors: Michael J. Brusco, Hans-Friedrich Köhn 
Publication date: 24 September 2008
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-007-9021-4
Recommendations
cluster analysisheuristicsbranch and bound\(p\)-median problemLagrangian relaxationcombinatorial data analysis
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Clustering in the social and behavioral sciences (91C20)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Hierarchical clustering schemes
- Cluster analysis and mathematical programming
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
- Validation of subgradient optimization
- Title not available (Why is that?)
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Combinatorial data analysis. Optimization by dynamic programming
- The Structural Representation of Proximity Matrices with MATLAB
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Title not available (Why is that?)
- Cluster Analysis and Mathematical Programming
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Variable neighborhood decomposition search
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- A comparison of two dual-based procedures for solving the p-median problem
- Cluster Analysis: An Application of Lagrangian Relaxation
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- Technical Note—An Algorithm for the p-Median Problem
- Solution of large-scale symmetric travelling salesman problems
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Title not available (Why is that?)
- A tree search algorithm for the p-median problem
Cited In (11)
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- K-medoids inverse regression
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- Exemplar-based clustering via simulated annealing
- Affinity propagation and uncapacitated facility location problems
- 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
- Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods
- An extension of the \(p\)-median group technology algorithm
- Optimal partition of the furniture manufacturing in Croatia
- A computational study of a nonlinear minsum facility location problem
Uses Software
This page was built for publication: Optimal partitioning of a data set based on the \(p\)-median model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946677)
