Optimal partitioning of a data set based on the \(p\)-median model
type: Item
instance of: scholarly article
title: Optimal partitioning of a data set based on the \(p\)-median model
zbMATH Open document ID: 1143.62035
author: Michael J. Brusco
author: Hans-Friedrich Köhn
published in: Psychometrika
publication date: 2008-09-24T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 91C20
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 65C60
zbMATH DE Number: 5346460
zbMATH Keywords: combinatorial data analysis
zbMATH Keywords: cluster analysis
zbMATH Keywords: \(p\)-median problem
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: branch and bound
zbMATH Keywords: heuristics
describes a project that uses: TSPLIB
describes a project that uses: AS 136
MaRDI profile type: MaRDI publication profile
full work available at URL: s11336-007-9021-4
OpenAlex ID: W2056223092
cites work: The Relaxation Method for Linear Inequalities
cites work: Solving the \(p\)-median problem with a semi-Lagrangian relaxation
cites work: A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
cites work: Q5706832
cites work: A tree search algorithm for the p-median problem
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
cites work: Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Solution of large-scale symmetric travelling salesman problems
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: A comparison of two dual-based procedures for solving the p-median problem
cites work: Cluster analysis and mathematical programming
cites work: Variable neighborhood decomposition search
cites work: Q4148820
cites work: Algorithm AS 136: A K-Means Clustering Algorithm
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Validation of subgradient optimization
cites work: Q3765005
cites work: Q3713407
cites work: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
cites work: Combinatorial data analysis. Optimization by dynamic programming
cites work: The Structural Representation of Proximity Matrices with MATLAB
cites work: Hierarchical clustering schemes
cites work: The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q5617409
cites work: Cluster Analysis: An Application of Lagrangian Relaxation
cites work: Technical Note—An Algorithm for the p-Median Problem
cites work: Cluster Analysis and Mathematical Programming
cites work: Q4773020
cites work: Q3875132
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
DOI: 10.1007/S11336-007-9021-4
description: scientific article; zbMATH DE number 5346460