On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (Q3760268): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q30040735, #quickstatements; #temporary_batch_1712101902020 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.12.2.255 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991595252 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q30040735 / rank | |||
Normal rank | |||
Latest revision as of 02:30, 3 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem |
scientific article |
Statements
On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (English)
0 references
1987
0 references
facility location in the plane
0 references
1-center problem
0 references
Elzinga-Hearn algorithm
0 references
\(\epsilon \)-approximate solution
0 references
