Reducing the hierarchical network design problem

DOI10.1016/0377-2217(89)90170-7MaRDI QIDQ1121181zbMATH OpenOpenAlexFDO

Authors A. Volgenant, Cees 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

minimum spanning treeLagrangean relaxationLagrangean multipliersdirected Steiner tree problemgeneralized transportationHierarchical Network Design

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4152177
• The hierarchical network design problem
• An addendum to the hierarchical network design problem
• The hierarchical network design problem with multiple primary paths
• The hierarchical network design problem with transshipment facilities

Cites work

• scientific article; zbMATH DE number 3914115 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An edge elimination test for the Steiner problem in graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Reduction tests for the steiner problem in grapsh
• Some generalizations of the steiner problem in graphs
• The hierarchical network design problem

Cited in

(15)

• An addendum to the hierarchical network design problem
• The hierarchical network design problem with multiple primary paths
• scientific article; zbMATH DE number 4152177 (Why is no real title available?)
• Parallel algorithms for a multi-level network optimization problem
• The multi-weighted spanning tree problem
• Algorithms for a multi-level network optimization problem
• The hierarchical network design problem
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• A review of extensive facility location in networks
• A branch and cut algorithm for the hierarchical network design problem
• A Lagrangian relaxation approach for expansion of a highway network
• The vehicle routing-allocation problem: A unifying framework
• Optimal design of hierarchical networks with free main path extremes
• An edge elimination test for the Steiner problem in graphs
• The multi-weighted Steiner tree problem

Describes a project that uses

Uses Software

• Algorithm 97

This page was built for publication: Reducing the hierarchical network design problem

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