Locating concentrators in centralized computer networks

DOI10.1007/BF02094332zbMath0825.90376MaRDI QIDQ1197789

Hasan Pirkul, Vaidyanathan Nagarajan

Publication date: 16 January 1993

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Survivability in hierarchical telecommunications networks ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ Solution procedures for the service system design problem ⋮ Topological Design of Centralized Computer Networks ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem ⋮ Hybrid fiber co-axial CATV network design with variable capacity optical network units ⋮ Location of hubs in a competitive environment ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A heuristic lagrangean algorithm for the capacitated plant location problem
• The hierarchical network design problem
• An integer programming model for the allocation of databases in a distributed computer system
• Efficient algorithms for the capacitated concentrator location problem
• The hierarchical network design problem with transshipment facilities
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Dual-Based Procedure for Uncapacitated Facility Location
• Approximate Traveling Salesman Algorithms
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Topological design of centralized computer networks—formulations and algorithms
• Large-Scale Network Topological Optimization
• NEWCLUST: An Algorithm for the Topological Design of Two-Level, Multidrop Teleprocessing Networks
• Validation of subgradient optimization
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Locating concentrators in centralized computer networks