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 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:40, 3 February 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
