A simple heuristic for the p-centre problem (Q761233): 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/0167-6377(85)90002-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013089587 / rank | |||
Normal rank | |||
Revision as of 22:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple heuristic for the p-centre problem |
scientific article |
Statements
A simple heuristic for the p-centre problem (English)
0 references
1985
0 references
We describe a simple heuristic for determining the p-centre of a finite set of weighted points in an arbitrary metric space. The computational effort is O(np) for an n-point set. We show that the ratio of the objective function value of the heuristic solution to that of the optimum is bounded by \(\min (3,1+\alpha)\), where \(\alpha\) is the maximum weight divided by the minimum weight of points in the set.
0 references
heuristic
0 references
p-centre
0 references
finite set of weighted points
0 references
