An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664)
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: An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks |
scientific article; zbMATH DE number 1079006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks |
scientific article; zbMATH DE number 1079006 |
Statements
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (English)
0 references
26 October 1997
0 references
capacitated subtree of a tree problem
0 references
branch-and-bound
0 references
0.87966865
0 references
0.87966865
0 references
0.8698655
0 references
0.8637389
0 references
0.8612797
0 references
0 references
0.8571369
0 references
0.8568629
0 references
