Density based problem space search for the capacitated clustering p-median problem

DOI10.1023/B:ANOR.0000039511.61195.21zbMATH Open1067.90125OpenAlexW2042605256MaRDI QIDQ702709FDOQ702709

Authors: Samad Ahmadi, Ibrahim. H Osman 

Publication date: 17 January 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000039511.61195.21

Recommendations

• Clustering search algorithm for the capacitated centered clustering problem
• scientific article; zbMATH DE number 1247176
• The heterogeneous \(p\)-median problem for categorization based clustering
• Scatter search for an uncapacitated \(p\)-hub median problem
• The capacitated centred clustering problem
• A scatter search heuristic for the capacitated clustering problem
• Solving capacitated clustering problems
• Heuristic search to the capacitated clustering problem
• Tabu search and GRASP for the capacitated clustering problem

zbMATH Keywords

metaheuristicsCapacitated clustering (\(p\)-median) problemgreedy density searchguided construction search methodproblem-space search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Cited In (13)

• Clustering search algorithm for the capacitated centered clustering problem
• The capacitated centred clustering problem
• Model-based capacitated clustering with posterior regularization
• Heuristic search to the capacitated clustering problem
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
• A scatter search heuristic for the capacitated clustering problem
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
• A matheuristic for large-scale capacitated clustering
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem

This page was built for publication: Density based problem space search for the capacitated clustering \(p\)-median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702709)