A minimax assignment problem in treelike communication networks (Q1390338)
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 1175101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimax assignment problem in treelike communication networks |
scientific article; zbMATH DE number 1175101 |
Statements
A minimax assignment problem in treelike communication networks (English)
0 references
5 July 1999
0 references
minimax assignment
0 references
location problem
0 references
communication centres
0 references
undirected network
0 references
branch-and-bound
0 references
0 references
0 references
0.8911507
0 references
0.8853182
0 references
0.8732554
0 references
0.8708738
0 references
0.8681725
0 references
