The \(p\) maximal cover -- \(p\) partial center problem on networks

DOI10.1016/0377-2217(94)90321-2zbMath0809.90092OpenAlexW2005967762MaRDI QIDQ1317171

Oded Berman

Publication date: 28 March 1995

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90321-2

zbMATH Keywords

branch-and-boundheuristicmaximum coverminimax distance\(p\) maximal cover problem\(p\) partial center problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (4)

On the conditional \(p\)-median problem ⋮ The gradual covering decay location problem on a network. ⋮ The generalized maximal covering location problem ⋮ The variable radius covering problem

Cites Work

• The p-cover problem
• Heuristic procedures for the m-partial cover problem on a plane
• The Maximum Coverage Location Problem
• Note—On a Modified One-Center Model
• Optimal Location of Discretionary Service Facilities
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(p\) maximal cover -- \(p\) partial center problem on networks