An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications (Q4838249)
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 the Multiperiod Capacity Expansion of One Location in Telecommunications |
scientific article; zbMATH DE number 772300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications |
scientific article; zbMATH DE number 772300 |
Statements
An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications (English)
0 references
1 August 1995
0 references
minimum cost multiperiod capacity expansion
0 references
telecommunications network planning
0 references
time-dependent knapsack problem
0 references
shortest path
0 references
worst-case time complexity
0 references
0.7954664826393127
0 references
0.7650598287582397
0 references
0.7382930517196655
0 references
0.7331506609916687
0 references
0.7215390801429749
0 references
