A suboptimal solution to a hierarchical network design problem using dynamic programming

DOI10.1016/0377-2217(94)00056-IzbMath0903.90173OpenAlexW2082156696MaRDI QIDQ1388941

N. G. F. Sancho

Publication date: 11 June 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00056-i

zbMATH Keywords

dynamic programmingshortest pathnetworksshortest spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (6)

A branch and cut algorithm for the hierarchical network design problem ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ An addendum to the hierarchical network design problem ⋮ The hierarchical network design problem with multiple primary paths ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• The hierarchical network design problem
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Unnamed Item

This page was built for publication: A suboptimal solution to a hierarchical network design problem using dynamic programming