Centralized teleprocessing network design
From MaRDI portal
Publication:3037333
DOI10.1002/net.3230130211zbMath0523.94032OpenAlexW2025325419MaRDI QIDQ3037333
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
algorithmrelaxationoptimal designbranch and bound methodconstrained minimum spanning treecentralized telecommunication network
Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15) Numerical methods of relaxation type (49M20)
Related Items (9)
Topological design of a centralized communication network with unreliable links and node outage costs ⋮ Two Matching Based Algorithm for Tree Network Design ⋮ Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem ⋮ Combined capacity planning and concentrator location in computer communications networks ⋮ A multiperiod planning model for the capacitated minimal spanning tree problem ⋮ Topological design of telecommunication networks --- local access design methods ⋮ Matroids, generalized networks, and electric network synthesis ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Models for planning capacity expansion in local access telecommunication networks
This page was built for publication: Centralized teleprocessing network design
