The hierarchical network design problem with multiple primary paths

DOI10.1016/0377-2217(95)00333-9zbMath0924.90130OpenAlexW2005480958WikidataQ127236838 ScholiaQ127236838MaRDI QIDQ1278494

N. G. F. Sancho

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00333-9

zbMATH Keywords

dynamic programminghierarchical network designsuboptimal solutionmultiple primary pathsshortest spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

A branch and cut algorithm for the hierarchical network design problem ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Hierarchical facility network planning model for global logistics network configurations

Cites Work

• The hierarchical network design problem
• A suboptimal solution to a hierarchical network design problem using dynamic programming
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures

This page was built for publication: The hierarchical network design problem with multiple primary paths