Optimal design of centralized computer networks

DOI10.1002/NET.3230010105zbMath0234.94026OpenAlexW1964924757MaRDI QIDQ5643888

No author found.

Publication date: 1971

Published in: Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (11)

LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY ⋮ Topological design of a centralized communication network with unreliable links and node outage costs ⋮ Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks ⋮ Network reliability: Heading out on the highway ⋮ A multiperiod planning model for the capacitated minimal spanning tree problem ⋮ A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ Network decomposition-based benchmark results for the discrete time-cost tradeoff problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Optimal procedures for the discrete time/cost trade-off problem in project networks ⋮ An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure

Cites Work

• Unnamed Item
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Optimal design of centralized computer networks