The hierarchical network design problem

DOI10.1016/S0377-2217(86)80007-8zbMath0603.90131OpenAlexW2010140631MaRDI QIDQ1083378

Charles S. Re Velle, John R. Current, Jared L. Cohon

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(86)80007-8

zbMATH Keywords

heuristicminimum spanning treeinteger linear programshortest path algorithmhierarchical network design problemleast cost, two-level hierarchical network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (26)

Two-level rectilinear Steiner trees ⋮ Branch-and-price algorithm for the resilient multi-level hop-constrained network design ⋮ A branch and cut algorithm for the hierarchical network design problem ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ Reducing the hierarchical network design problem ⋮ Multiobjective routing problems ⋮ A suboptimal solution to a hierarchical network design problem using dynamic programming ⋮ The multi-weighted spanning tree problem ⋮ Approximation algorithms for priority Steiner tree problems ⋮ A minimum length covering subgraph of a network ⋮ The hierarchical network design problem with transshipment facilities ⋮ 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 ⋮ Locating concentrators in centralized computer networks ⋮ Hierarchical facility network planning model for global logistics network configurations ⋮ The multi-weighted Steiner tree problem: A reformulation by intersection ⋮ Optimal hierarchical system of a grid road network ⋮ Towards optimizing the deployment of optical access networks ⋮ An addendum to the hierarchical network design problem ⋮ The vehicle routing-allocation problem: A unifying framework ⋮ A review of extensive facility location in networks ⋮ The hierarchical network design problem with multiple primary paths ⋮ Efficient solution methods for covering tree problems ⋮ Algorithms for a multi-level network optimization problem ⋮ Investment planning for urban roads

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Multiobjective programming and planning
• On algorithms for finding the k shortest paths in a network
• Shortest-path algorithms: Taxonomy and annotation
• On the symmetric travelling salesman problem: A computational study
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• An efficient algorithm for K shortest simple paths
• Deterministic network optimization: A bibliography
• Iterative methods for determining the k shortest paths in a network
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: The hierarchical network design problem