Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (Q3790916)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4055343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons |
scientific article; zbMATH DE number 4055343 |
Statements
Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (English)
0 references
1986
0 references
computational experience
0 references
optimal location for n supply centers
0 references
transportation cost
0 references
single supply center
0 references
convex polygon with uniform demand distribution
0 references
optimality condition
0 references
fixed point algorithm
0 references
0.8113518357276917
0 references
0.7974397540092468
0 references
0.7973865270614624
0 references
0.7886850237846375
0 references
0.7871971130371094
0 references
