The p-cover problem (Q1079475): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0377-2217(86)90196-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2072766265 / rank | |||
Normal rank |
Revision as of 22:28, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The p-cover problem |
scientific article |
Statements
The p-cover problem (English)
0 references
1986
0 references
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.
0 references
facility location
0 references
marketing
0 references
p-cover problem
0 references
buying power
0 references