The \(K\)-coverage concentrator location problem (Q1193145)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 62031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(K\)-coverage concentrator location problem |
scientific article; zbMATH DE number 62031 |
Statements
The \(K\)-coverage concentrator location problem (English)
0 references
27 September 1992
0 references
computer networks
0 references
\(K\)-coverage problem
0 references
centralized teleprocessing network
0 references
single-source capacitated warehouse location
0 references
subgradient algorithm
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0.8218786120414734
0 references
0.8205646872520447
0 references
0.8032122254371643
0 references
