A suboptimal solution to a hierarchical network design problem using dynamic programming (Q1388941): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 11:57, 28 May 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
