Algorithms for the m-center problems: A survey

DOI10.1016/0377-2217(82)90136-9zbMath0481.90021OpenAlexW2086292024MaRDI QIDQ1162436

Jonathan Halpern, Oded Z. Maimon

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90136-9

zbMATH Keywords

surveyalgorithmslocation on graphm-center problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05)

Related Items (5)

Location and layout planning. A survey ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ On worst-case aggregation analysis for network location problems ⋮ Kinetic maintenance of mobile \(k\)-centres on trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The m-Center Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Algorithms for the m-center problems: A survey