Heuristic cluster algorithm for multiple facility location-allocation problem

DOI10.1051/ro/1991250100971zbMath0726.90043OpenAlexW2524000704MaRDI QIDQ3348692

No author found.

Publication date: 1991

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

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

zbMATH Keywords

cluster analysisp-median problemheuristic partitionmultiple facility location-allocation problemoptimal partition of the demand point set

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

The \(p\)-median problem: a survey of metaheuristic approaches ⋮ A two-echelon joint continuous-discrete location model ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ New local searches for solving the multi-source Weber problem ⋮ Kohonen maps for solving a class of location-allocation problems

This page was built for publication: Heuristic cluster algorithm for multiple facility location-allocation problem