Centralized teleprocessing network design

DOI10.1002/NET.3230130211MaRDI QIDQ3037333zbMATH OpenOpenAlexFDO

Authors Aaron Kershenbaum, Robert Roy Boorstyn

Publication date 1983

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230130211

zbMATH Keywords

algorithmbranch and bound methodcentralized telecommunication networkconstrained minimum spanning treeoptimal designrelaxation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical methods of relaxation type (49M20) Applications of graph theory to circuits and networks (94C15)

Cited in

(9)

• Topological design of telecommunication networks --- local access design methods
• Matroids, generalized networks, and electric network synthesis
• Topological design of a centralized communication network with unreliable links and node outage costs
• A multiperiod planning model for the capacitated minimal spanning tree problem
• Design of capacitated degree constrained min-sum arborescence
• Combined capacity planning and concentrator location in computer communications networks
• Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
• Two Matching Based Algorithm for Tree Network Design
• Models for planning capacity expansion in local access telecommunication networks

This page was built for publication: Centralized teleprocessing network design

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