The Hierarchical Network Design Problem: A New Formulation and Solution Procedures

DOI10.1287/TRSC.25.3.175MaRDI QIDQ3356059zbMATH OpenOpenAlexFDO

Authors Hasan Pirkul, John R. Current, Vaidyanathan Nagarajan

Publication date 1991

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.25.3.175

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Cited in

(10)

• The hierarchical network design problem with transshipment facilities
• Locating concentrators in centralized computer networks
• A review of extensive facility location in networks
• The hierarchical network design problem with multiple primary paths
• Investment planning for urban roads
• A suboptimal solution to a hierarchical network design problem using dynamic programming
• The vehicle routing-allocation problem: A unifying framework
• A branch and cut algorithm for the hierarchical network design problem
• A Lagrangian relaxation approach for expansion of a highway network
• Optimal design of hierarchical networks with free main path extremes

This page was built for publication: The Hierarchical Network Design Problem: A New Formulation and Solution Procedures

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