A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems (Q3042820): 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.1080/03155986.1983.11731889 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W34103176 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems |
scientific article |
Statements
A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems (English)
0 references
1983
0 references
greedy interchange heuristic
0 references
large scale clustering
0 references
uncapacitated median location
0 references
computational experience
0 references
large randomly generated networks
0 references
set partitioning
0 references
