Clustering search algorithm for the capacitated centered clustering problem
From MaRDI portal
Recommendations
- Density based problem space search for the capacitated clustering p-median problem
- A scatter search heuristic for the capacitated clustering problem
- The capacitated centred clustering problem
- Heuristic search to the capacitated clustering problem
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
Cites work
- scientific article; zbMATH DE number 5501651 (Why is no real title available?)
- scientific article; zbMATH DE number 1253040 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- A column generation approach to capacitated \(p\)-median problems
- A scatter search heuristic for the capacitated clustering problem
- A tree search algorithm for the p-median problem
- An effective VNS for the capacitated \(p\)-median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Optimization by simulated annealing
- The capacitated centred clustering problem
Cited in
(21)- The capacitated centred clustering problem
- Density based problem space search for the capacitated clustering p-median problem
- Using clustering analysis in a capacitated location-routing problem
- Heuristic search to the capacitated clustering problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A reactive GRASP with path relinking for capacitated clustering
- Optimization problems for machine learning: a survey
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
- Solving capacitated clustering problems
- A scatter search heuristic for the capacitated clustering problem
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- Capacitated clustering problems applied to the layout of IT-teams in software factories
- Multiple depot vehicle routing problems on clustering algorithms
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- A comparison of three metaheuristics for the workover rig routing problem
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- Hybrid matheuristics for the multi-capacitated clustering problem
This page was built for publication: Clustering search algorithm for the capacitated centered clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038295)
