The hierarchical network design problem with transshipment facilities
From MaRDI portal
Publication:1178636
DOI10.1016/0377-2217(91)90309-JzbMath0738.90080OpenAlexW2035730307MaRDI QIDQ1178636
Publication date: 26 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90309-j
Lagrange multipliersheuristicsLagrangian relaxationhierarchical network designtransshipment facilitiesleast cost, two- level network
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Survivability in hierarchical telecommunications networks, A branch and cut algorithm for the hierarchical network design problem, Optimal design of hierarchical networks with free main path extremes, Locating concentrators in centralized computer networks, Towards optimizing the deployment of optical access networks, The vehicle routing-allocation problem: A unifying framework, A review of extensive facility location in networks, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- The hierarchical network design problem
- An integer programming model for the allocation of databases in a distributed computer system
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
- The Design of a Hierarchical Transportation Network with Transshipment Facilities
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Topological design of centralized computer networks—formulations and algorithms
- `` Strong NP-Completeness Results
- Validation of subgradient optimization
- The Traveling-Salesman Problem and Minimum Spanning Trees
