The hierarchical network design problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070602 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- An efficient algorithm for K shortest simple paths
- Deterministic network optimization: A bibliography
- 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
Cited in
(32)- Locating concentrators in centralized computer networks
- Reducing the hierarchical network design problem
- An addendum to the hierarchical network design problem
- The hierarchical network design problem with multiple primary paths
- A suboptimal solution to a hierarchical network design problem using dynamic programming
- A minimum length covering subgraph of a network
- scientific article; zbMATH DE number 4152177 (Why is no real title available?)
- Optimal design of a distributed network with a two-level hierarchical structure
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- Parallel algorithms for a multi-level network optimization problem
- Efficient solution methods for covering tree problems
- The Design of a Hierarchical Transportation Network with Transshipment Facilities
- The multi-weighted spanning tree problem
- Algorithms for a multi-level network optimization problem
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- Two-level rectilinear Steiner trees
- scientific article; zbMATH DE number 3914111 (Why is no real title available?)
- Investment planning for urban roads
- Multiobjective routing problems
- A review of extensive facility location in networks
- A Stackelberg approach to transportation infrastructure planning: integrating user decision-making
- Towards optimizing the deployment of optical access networks
- A branch and cut algorithm for the hierarchical network design problem
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Approximation algorithms for priority Steiner tree problems
- A Lagrangian relaxation approach for expansion of a highway network
- Optimal hierarchical system of a grid road network
- The vehicle routing-allocation problem: A unifying framework
- Optimal design of hierarchical networks with free main path extremes
- Hierarchical facility network planning model for global logistics network configurations
- The hierarchical network design problem with transshipment facilities
- The multi-weighted Steiner tree problem
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)