Optimal partitioning of a data set based on the \(p\)-median model

DOI10.1007/s11336-007-9021-4zbMath1143.62035OpenAlexW2056223092MaRDI QIDQ946677

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

zbMATH Keywords

heuristicsLagrangian relaxationbranch and bound\(p\)-median problemcluster analysiscombinatorial data analysis

Mathematics Subject Classification ID

Related Items (8)

K-medoids inverse regression ⋮ Affinity propagation: An exemplar‐based tool for clustering in psychological research ⋮ The heterogeneous \(p\)-median problem for categorization based clustering ⋮ A computational study of a nonlinear minsum facility location problem ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Exemplar-based clustering via simulated annealing ⋮ Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem

Uses Software

• TSPLIB
• AS 136

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Solution of large-scale symmetric travelling salesman problems
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• A comparison of two dual-based procedures for solving the p-median problem
• A tree search algorithm for the p-median problem
• Cluster analysis and mathematical programming
• Variable neighborhood decomposition search
• Hierarchical clustering schemes
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• Combinatorial Data Analysis
• Cluster Analysis: An Application of Lagrangian Relaxation
• The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Validation of subgradient optimization
• The Structural Representation of Proximity Matrices with MATLAB
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Cluster Analysis and Mathematical Programming
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Optimal partitioning of a data set based on the \(p\)-median model