Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545)
From MaRDI portal
!
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 5217002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for a two-level hierarchical location problem in computer networks |
scientific article; zbMATH DE number 5217002 |
Statements
Lower and upper bounds for a two-level hierarchical location problem in computer networks (English)
0 references
30 November 2007
0 references
hierarchical location problems
0 references
design of computer networks
0 references
Lagrangean relaxation
0 references
tabu search
0 references
0 references
0 references
0 references
0.8246843814849854
0 references
0.7998918294906616
0 references
0.7901413440704346
0 references
0.7824277281761169
0 references
