An iterative algorithm for the multifacility minimax location problem with euclidean distances (Q3912332): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800280214 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048030940 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Locating facilities in three‐dimensional space by convex programming / rank | |||
Normal rank | |||
Latest revision as of 12:28, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative algorithm for the multifacility minimax location problem with euclidean distances |
scientific article |
Statements
An iterative algorithm for the multifacility minimax location problem with euclidean distances (English)
0 references
1981
0 references
iterative algorithm
0 references
multifacility minimax location
0 references
Euclidean distances
0 references
computational experience
0 references
