Models for planning capacity expansion in local access telecommunication networks

DOI10.1007/BF02071976zbMath0729.90678MaRDI QIDQ806810

N. E. Zubov

Publication date: 1991

Published in: Annals of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items

Modelling piecewise linear concave costs in a tree partitioning problem, Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales, Routing of uncertain traffic demands, Heuristics for multi-period capacity expansion in local telecommunications networks, Network flow models for the local access network expansion problem, A node rooted flow-based model for the local access network expansion problem, A constrained Steiner tree problem, A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Telecommunications network design: Technology impacts and future directions, Equitable bandwidth allocation in content distribution networks, A splitter location-allocation problem in designing fiber optic access networks, Equilibrium network design of shared-vehicle systems, Multi-period capacity expansion for a local access telecommunications network, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Tree knapsack approaches for local access network design, Cost-effective designs of fault-tolerant access networks in communication systems, Multi-period maintenance scheduling of tree networks with minimum flow disruption, Towards optimizing the deployment of optical access networks, A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints, The network redesign problem for access telecommunications networks, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, An equitable bandwidth allocation model for video-on-demand networks, New modeling approaches for the design of local access transport area networks, A dynamic programming algorithm for the local access telecommunication network expansion problem, Algorithms for a multi-level network optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• The telephonic switching centre network problem: Formalization and computational experience
• Packing and covering a tree by subtrees
• Solving the optimal network problem
• Valid inequalities and facets of the capacitated plant location problem
• Centralized teleprocessing network design
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Optimal Modernization Policies for Telecommunications Facilities
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Database Location in Computer Networks
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Large-Scale Network Topological Optimization
• Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals
• The complexity of the network design problem
• Exact and approximate algorithms for optimal network design
• A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
• A decomposition algorithm for capacity expansion of local access networks
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A Computational Approach to the Selection of an Optimal Network
• The Capacitated Minimum Spanning Tree