Optimal partitioning of a data set based on the p-median model
From MaRDI portal
(Redirected from Publication:946677)
Optimal partitioning of a data set based on the \(p\)-median model
Optimal partitioning of a data set based on the \(p\)-median model
Recommendations
Cites work
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 4022343 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- A comparison of two dual-based procedures for solving the p-median problem
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- A tree search algorithm for the p-median problem
- Algorithm AS 136: A K-Means Clustering Algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Cluster Analysis and Mathematical Programming
- Cluster Analysis: An Application of Lagrangian Relaxation
- Cluster analysis and mathematical programming
- Combinatorial data analysis. Optimization by dynamic programming
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Hierarchical clustering schemes
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Solution of large-scale symmetric travelling salesman problems
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Technical Note—An Algorithm for the p-Median Problem
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Structural Representation of Proximity Matrices with MATLAB
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Validation of subgradient optimization
- Variable neighborhood decomposition search
Cited in
(11)- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- K-medoids inverse regression
- Exemplar-based clustering via simulated annealing
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- 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
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)
