Reducing the hierarchical network design problem

DOI10.1016/0377-2217(89)90170-7zbMath0673.90087OpenAlexW2065568963MaRDI QIDQ1121181

A. Volgenant, Cees W. Duin

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90170-7

zbMATH Keywords

Lagrangean relaxationminimum spanning treeLagrangean multipliersdirected Steiner tree problemgeneralized transportationHierarchical Network Design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Hierarchical systems (93A13)

Related Items

A branch and cut algorithm for the hierarchical network design problem, Parallel algorithms for a multi-level network optimization problem, An edge elimination test for the Steiner problem in graphs, The multi-weighted spanning tree problem, The multi-weighted Steiner tree problem, Optimal design of hierarchical networks with free main path extremes, A Lagrangian relaxation approach for expansion of a highway network, An addendum to the hierarchical network design problem, The vehicle routing-allocation problem: A unifying framework, A review of extensive facility location in networks, Algorithms for a multi-level network optimization problem, Worst-case performance of some heuristics for Steiner's problem in directed graphs

Uses Software

• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The hierarchical network design problem
• An edge elimination test for the Steiner problem in graphs
• Some generalizations of the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• Unnamed Item
• Unnamed Item
• Unnamed Item