The p-cover problem

DOI10.1016/0377-2217(86)90196-7MaRDI QIDQ1079475zbMATH OpenOpenAlexFDO

Authors 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

buying powerfacility locationmarketingp-cover problem

Mathematics Subject Classification ID

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

Review text

The p-cover problem deals with covering the most buying power with p new facilities. Each facility covers an area of a certain shape and size. When distances are rectilinear then the area covered by a facility has a shape of a diamond (a square rotated by \(45^ o)\). It is suggested to rotate the area by \(45^ o\), and thus each facility covers a square parallel to the axes. The data about the buying power is therefore given as a matrix where every entry in the matrix represents one basic square in a grid. Each facility covers a square that consists of k by k basic squares. K is determined by the size of the area of influence of the facility and the size of the basic square. The 1-cover problem is converted to selecting the k by k submatrix with the maximal sum of entries. If the area of influence is a rectangle of m by n basic squares, the problem is solved in o(mn) time. The p-cover problem for \(p>1\) is also discussed.

Recommendations

• On rectangular covering problems
• The variable radius covering problem
• On the p‐coverage problem on the real line
• New heuristic algorithms for the rectangular p-cover problem
• The multicovering problem

Cites work

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

Cited in

(13)

• The variable radius covering problem
• The \(p\) maximal cover -- \(p\) partial center problem on networks
• The gradual covering decay location problem on a network.
• A mixed integer formulation for maximal covering by inclined parallelograms
• On the conditional \(p\)-median problem
• Covering part of a planar network
• scientific article; zbMATH DE number 3912199 (Why is no real title available?)
• Almost optimal solutions to k-clustering problems
• The Ferry Cover Problem
• The generalized maximal covering location problem
• Fast heuristics for large scale covering-location problems
• The ordered covering problem
• Generalized coverage: new developments in covering location models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079475)