Planar maximal covering location problem under block norm distance measure

DOI10.1057/palgrave.jors.2602172zbMath1177.90261OpenAlexW1983476281MaRDI QIDQ5428968

George O. Wesolowsky, Hassan Younies

Publication date: 29 November 2007

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602172

zbMATH Keywords

heuristicsblock normsclique partitioningfacilities locationplanar maximal covering

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (3)

A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ A practical heuristic for maximum coverage in large-scale continuous location problem ⋮ New exact algorithms for planar maximum covering location by ellipses problems

This page was built for publication: Planar maximal covering location problem under block norm distance measure