Topological design of telecommunication networks --- local access design methods

DOI10.1007/BF02061657zbMath0736.90030MaRDI QIDQ1179728

Bezalel Gavish

Publication date: 27 June 1992

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

zbMATH Keywords

telecommunication systemslocal access network

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (37)

Routing of uncertain traffic demands ⋮ Cost-optimal topology planning of hierarchical access networks ⋮ A global optimization algorithm for reliable network design ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ Two new algorithms for UMTS access network topology design ⋮ A two-level location-allocation problem in designing local access fiber optic networks ⋮ A constrained Steiner tree problem ⋮ The \((K, k)\)-capacitated spanning tree problem ⋮ Some thoughts on combinatorial optimisation ⋮ Designing tributary networks with multiple ring families. ⋮ RAMP for the capacitated minimum spanning tree problem ⋮ Tree network design avoiding congestion ⋮ Equitable bandwidth allocation in content distribution networks ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ A new approach for solving the network problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Topological design of computer communication networks -- the overall design problem ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A splitter location-allocation problem in designing fiber optic access networks ⋮ Facility location models for distribution system design ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ 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 ⋮ A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem ⋮ Towards optimizing the deployment of optical access networks ⋮ The network redesign problem for access telecommunications networks ⋮ A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem ⋮ A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. ⋮ Solving to optimality the uncapacitated fixed-charge network flow problem ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ An equitable bandwidth allocation model for video-on-demand networks ⋮ Location of hubs in a competitive environment ⋮ Bounding quality of pure Nash equilibria in dual-role facility location games ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem ⋮ Algorithms for a multi-level network optimization problem ⋮ Savings based ant colony optimization for the capacitated minimum spanning tree problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient algorithms for the capacitated concentrator location problem
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Complexity of spanning tree problems: Part I
• On the complexity of finding multi-constrained spanning trees
• Topological design of computer communication networks -- the overall design problem
• Analysis of heuristics for the design of tree networks
• Centralized teleprocessing network design
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• Bounds and Heuristics for Capacitated Routing Problems
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• The complexity of the capacitated tree problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Topological design of centralized computer networks—formulations and algorithms
• Parallel Savings Based Heuristics for the Delivery Problem
• Efficient Algorithms for Shortest Paths in Sparse Networks
• A New Class of Algorithms for Multipoint Network Optimization
• Large-Scale Network Topological Optimization
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• The One-Terminal TELPAK Problem
• The Loading Problem
• The Capacitated Minimum Spanning Tree

This page was built for publication: Topological design of telecommunication networks --- local access design methods