A suboptimal solution to a hierarchical network design problem using dynamic programming (Q1388941): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The hierarchical network design problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest paths, single origin‐destination network design, and associated polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Hierarchical Network Design Problem: A New Formulation and Solution Procedures / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)00056-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082156696 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A suboptimal solution to a hierarchical network design problem using dynamic programming |
scientific article |
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
