The p-cover problem

DOI10.1016/0377-2217(86)90196-7zbMath0597.90028OpenAlexW2072766265MaRDI QIDQ1079475

Zvi Drezner

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90196-7

zbMATH Keywords

marketingfacility locationbuying powerp-cover problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Permutations, words, matrices (05A05) Inventory, storage, reservoirs (90B05)

Related Items (9)

Covering part of a planar network ⋮ On the conditional \(p\)-median problem ⋮ The gradual covering decay location problem on a network. ⋮ Generalized coverage: new developments in covering location models ⋮ ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS ⋮ The generalized maximal covering location problem ⋮ Fast heuristics for large scale covering-location problems ⋮ The variable radius covering problem ⋮ The \(p\) maximal cover -- \(p\) partial center problem on networks

Cites Work

• Heuristic procedures for the m-partial cover problem on a plane
• On locating new facilities in a competitive environment
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Note—On a Modified One-Center Model

This page was built for publication: The p-cover problem