Locating concentrators in centralized computer networks

DOI10.1007/BF02094332MaRDI QIDQ1197789zbMATH OpenFDO

Authors Hasan Pirkul, Vaidyanathan Nagarajan

Publication date 16 January 1993

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

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(9)

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

Describes a project that uses

Uses Software

• Algorithm 97

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197789)