Topological Design of Centralized Computer Networks

DOI10.1111/j.1475-3995.1997.tb00064.xzbMath0890.90063OpenAlexW4206646146MaRDI QIDQ4368605

Rakesh Gupta, Hasan Pirkul

Publication date: 6 July 1998

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00064.x

zbMATH Keywords

capacitated minimum spanning treeLagrangian heuristictopological designconcentrator locationcentralized computer-communication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (2)

Cost-optimal topology planning of hierarchical access networks ⋮ A mixed-integer approach to Core-Edge design of storage area networks

Cites Work

• A note on two problems in connexion with graphs
• Efficient algorithms for the capacitated concentrator location problem
• Locating concentrators in centralized computer networks
• Large-Scale Network Topological Optimization
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Topological Design of Centralized Computer Networks