An aggregation heuristic for large scale p-median problem
From MaRDI portal
Publication:1762151
DOI10.1016/j.cor.2011.09.016zbMath1251.90234OpenAlexW2029783501MaRDI QIDQ1762151
Pasquale Avella, Saverio Salerno, Maurizio Boccia, Igor' Leonidovich Vasilyev
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.016
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (19)
Principal points analysis via p-median problem for binary data ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ A quadtree-based allocation method for a class of large discrete Euclidean location problems ⋮ Demand point aggregation method for covering problems with gradual coverage ⋮ The min-p robust optimization approach for facility location problem under uncertainty ⋮ Solving the \(p\)-median problem on regular and lattice networks ⋮ A matheuristic for large-scale capacitated clustering ⋮ Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search ⋮ Discrete facility location in machine learning ⋮ A Branch Decomposition Algorithm for the p-Median Problem ⋮ The balanced \(p\)-median problem with unitary demand ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ An optimization and simulation approach to emergency stations relocation ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ A computational study of a nonlinear minsum facility location problem ⋮ Pharmacy duty scheduling problem ⋮ Near-optimal large-scale k-medoids clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale \(p\)-median problems
- An effective heuristic for large-scale capacitated facility location problems
- Cluster analysis and mathematical programming
- Heuristic methods for large centroid clustering problems
- A branch-and-price approach to \(p\)-median location problems
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- Variable neighborhood decomposition search
- Dynamic supply chain design with inventory
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Cluster Analysis: An Application of Lagrangian Relaxation
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Aggregation Error Bounds for a Class of Location Models
- Worst-case incremental analysis for a class ofp-facility location problems
- A Heuristic Method for the Set Covering Problem
- Integer Programming and the Theory of Grouping
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Cluster Analysis and Mathematical Programming
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: An aggregation heuristic for large scale p-median problem
