Clustering search algorithm for the capacitated centered clustering problem
From MaRDI portal
Publication:1038295
DOI10.1016/j.cor.2008.09.011zbMath1173.90413OpenAlexW1973557230WikidataQ58525156 ScholiaQ58525156MaRDI QIDQ1038295
Luiz Antonio Nogueira Lorena, Antônio Augusto Chaves
Publication date: 17 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.011
Related Items
A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, An efficient heuristic algorithm for the capacitated \(p\)-median problem, A comparison of three metaheuristics for the workover rig routing problem, Capacitated clustering problems applied to the layout of IT-teams in software factories, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, Optimization problems for machine learning: a survey, A clustering search metaheuristic for the point-feature cartographic label placement problem, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An effective VNS for the capacitated \(p\)-median problem
- A tree search algorithm for the p-median problem
- A column generation approach to capacitated \(p\)-median problems
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- The capacitated centred clustering problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
