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

DOI10.1023/B:ANOR.0000039511.61195.21zbMath1067.90125OpenAlexW2042605256MaRDI QIDQ702709

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

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)

Related Items (7)

A matheuristic for large-scale capacitated clustering ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ 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 tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ Greedy random adaptive memory programming search for the capacitated clustering problem ⋮ Model-based capacitated clustering with posterior regularization

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