New heuristic algorithms for the rectangular $p$-cover problem (Q4837962)
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: New heuristic algorithms for the rectangular $p$-cover problem |
scientific article; zbMATH DE number 770183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New heuristic algorithms for the rectangular $p$-cover problem |
scientific article; zbMATH DE number 770183 |
Statements
New heuristic algorithms for the rectangular $p$-cover problem (English)
0 references
31 July 1995
0 references
clustering
0 references
unweighted \(p\)-center
0 references
Tchebycheff norm
0 references
rectangular \(p\)- cover problem
0 references
heuristic
0 references
0.91114485
0 references
0.90985703
0 references
0.90658283
0 references
0.8970525
0 references
0.88960534
0 references
0.8891076
0 references
0.88488406
0 references
0.88421285
0 references
0.88232803
0 references
