Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Greedy random adaptive memory programming search for the capacitated clustering problem |
scientific article; zbMATH DE number 2132770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy random adaptive memory programming search for the capacitated clustering problem |
scientific article; zbMATH DE number 2132770 |
Statements
Greedy random adaptive memory programming search for the capacitated clustering problem (English)
0 references
9 February 2005
0 references
Ant colony optimization
0 references
Adaptive memory programming
0 references
Density search
0 references
Capacitated clustering (\(p\)-median) problem
0 references
Greedy randomized adaptive search procedure
0 references
Guided construction search metaheuristic
0 references
0 references
0 references
0 references
0 references
0.88372386
0 references
0 references
0.8781525
0 references
0.87612367
0 references
0.86932266
0 references
0.86679184
0 references
0.8653074
0 references
0.8632003
0 references
