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

DOI10.1016/0377-2217(94)00056-IMaRDI QIDQ1388941zbMATH OpenOpenAlexFDO

Authors 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 programmingnetworksshortest pathshortest spanning tree

Mathematics Subject Classification ID

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

Recommendations

• The hierarchical network design problem with multiple primary paths
• The hierarchical network design problem
• An addendum to the hierarchical network design problem
• scientific article; zbMATH DE number 4152177
• Design of one class of transportation networks by dynamic programming

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• Shortest paths, single origin‐destination network design, and associated polyhedra
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• The hierarchical network design problem

Cited in

(6)

• 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
• A branch and cut algorithm for the hierarchical network design problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Optimal design of hierarchical networks with free main path extremes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388941)