Lower and upper bounds for a two-level hierarchical location problem in computer networks
From MaRDI portal
Publication:2462545
Recommendations
- Upper and lower bounds for the two-level simple plant location problem
- scientific article; zbMATH DE number 1253063
- Efficient algorithms for the capacitated concentrator location problem
- Topological design of computer communication networks -- the overall design problem
- Topological Design of Centralized Computer Networks
Cites work
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A comparison of optimal methods for local access uncapacitated network design
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- An Algorithm for the Design of Multitype Concentrator Networks
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- An Overview of Representative Problems in Location Research
- Capacitated facility location problem with general setup cost
- Capacitated location-allocation problems on a line
- Cost-optimal topology planning of hierarchical access networks
- Efficient algorithms for the capacitated concentrator location problem
- Heuristics for distribution network design in telecommunication
- Heuristics for Two-Level Hierarchical Transportation Networks
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1253063 (Why is no real title available?)
- INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Locational analysis
- On the capacitated concentrator location problem: a reformulation by discretization
- Optimal design of a distributed network with a two-level hierarchical structure
- Optimization of resource location in hierarchical computer networks
- Selecting hierarchical facilities in a service-operations environment
- Solving the Hub location problem in telecommunication network design: A local search approach
- Solving the hub location problem with modular link capacities
- Tabu Search—Part I
- Tabu Search—Part II
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The tabu search metaheuristic: How we used it
- Topological design of computer communication networks -- the overall design problem
- Topological design of telecommunication networks --- local access design methods
- Upper and lower bounds for the two-level simple plant location problem
- Validation of subgradient optimization
Cited in
(9)- Multi-level facility location problems
- Dual-based heuristics for a hierarchical covering location problem
- An improved lower bound for the multimedian location problem
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- Exactly solving a two-level location problem with modular node capacities
- A two-level location-allocation problem in designing local access fiber optic networks
- scientific article; zbMATH DE number 1932373 (Why is no real title available?)
- An effective algorithm for the two-stage location problem on a tree-like network
- Optimization of resource location in hierarchical computer networks
This page was built for publication: Lower and upper bounds for a two-level hierarchical location problem in computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462545)
