A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion (Q4189077)
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 3626947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion |
scientific article; zbMATH DE number 3626947 |
Statements
A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion (English)
0 references
1979
0 references
Heuristic Branch-And-Bound Algorithm
0 references
Telephone Feeder Capacity Expansion
0 references
Telephonic Networks
0 references
Case Study
0 references
Computational Efficiency
0 references
