Heuristic methods for thep-center problem

DOI10.1051/ro/1991250100651zbMath0732.90056OpenAlexW2463747791MaRDI QIDQ3359995

Blas Pelegrín

Publication date: 1991

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105003

zbMATH Keywords

cluster analysisheuristic2-approximationp-center problem

Mathematics Subject Classification ID

Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Bee colony optimization for the \(p\)-center problem ⋮ The 1-center problem in the plane with independent random weights ⋮ Dominant, an algorithm for the \(p\)-center problem. ⋮ A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem

This page was built for publication: Heuristic methods for thep-center problem