Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons (Q3790916): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (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.1287/trsc.20.2.107 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023469046 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:44, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons |
scientific article |
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
