Network distance characteristics that affect computational effort in \(p\)-median location problems (Q1841151): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00336-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970442741 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network distance characteristics that affect computational effort in \(p\)-median location problems |
scientific article |
Statements
Network distance characteristics that affect computational effort in \(p\)-median location problems (English)
0 references
22 February 2001
0 references
location
0 references
combinatorial optimization
0 references
heuristics
0 references
\(p\)-median
0 references
Euclidean inter-point distances
0 references
shortest paths developed from a predefined network
0 references
randomly generated distance matrices
0 references
0 references
