A suboptimal solution to a hierarchical network design problem using dynamic programming (Q1388941)
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: A suboptimal solution to a hierarchical network design problem using dynamic programming |
scientific article; zbMATH DE number 1162965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A suboptimal solution to a hierarchical network design problem using dynamic programming |
scientific article; zbMATH DE number 1162965 |
Statements
A suboptimal solution to a hierarchical network design problem using dynamic programming (English)
0 references
11 June 1998
0 references
networks
0 references
dynamic programming
0 references
shortest spanning tree
0 references
shortest path
0 references
