The hierarchical network design problem
The authors introduce the hierarchical network design problem (HNDP). The object of the HNDP is to identify the least cost, two-level hierarchical network. The network must include a primary path from a predetermined starting node to a predetermined terminus node. In addition, each node not on the primary path must be connected to some node on that path by means of a secondary path. The problem is initially formulated as an integer linear program. An heuristic is then presented which employs a K shortest path algorithm, and a minimum spanning tree algorithm. Heuristic results of two sample problems are presented and compared to the results obtained by solving the integer LP formulation. Potential applications of the formulation are also discussed.
- An efficient algorithm for K shortest simple paths
- Deterministic network optimization: A bibliography
- scientific article; zbMATH DE number 4070602 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Iterative methods for determining the k shortest paths in a network
- Multiobjective programming and planning
- On algorithms for finding the k shortest paths in a network
- On the symmetric travelling salesman problem: A computational study
- Shortest-path algorithms: Taxonomy and annotation
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- Reducing the hierarchical network design problem
- The hierarchical network design problem with transshipment facilities
- The multi-weighted Steiner tree problem
- Locating concentrators in centralized computer networks
- Optimal design of a distributed network with a two-level hierarchical structure
- An addendum to the hierarchical network design problem
- 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
- A suboptimal solution to a hierarchical network design problem using dynamic programming
- The vehicle routing-allocation problem: A unifying framework
- Multiobjective routing problems
- Optimal hierarchical system of a grid road network
- Two-level rectilinear Steiner trees
- A branch and cut algorithm for the hierarchical network design problem
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Towards optimizing the deployment of optical access networks
- Approximation algorithms for priority Steiner tree problems
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- scientific article; zbMATH DE number 4152177 (Why is no real title available?)
- scientific article; zbMATH DE number 3914111 (Why is no real title available?)
- The Design of a Hierarchical Transportation Network with Transshipment Facilities
- scientific article; zbMATH DE number 1253063 (Why is no real title available?)
- A Dual-Based Algorithm for Multi-Level Network Design
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- Parallel algorithms for a multi-level network optimization problem
- A Lagrangian relaxation approach for expansion of a highway network
- The multi-weighted spanning tree problem
- A Stackelberg approach to transportation infrastructure planning: integrating user decision-making
- Hierarchical facility network planning model for global logistics network configurations
- A minimum length covering subgraph of a network
- Optimal design of hierarchical networks with free main path extremes
This page was built for publication: The hierarchical network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083378)
