SONET

swMATH10644MaRDI QIDQ22603

No author found.

Related Items (22)

A cutting plane algorithm for computing \(k\)-edge survivability of a network ⋮ The network design problem with relays ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ Reasoning on infeasibility in distributed collaborative computing environment ⋮ SONET/SDH ring assignment with capacity constraints ⋮ Designing tributary networks with multiple ring families. ⋮ A tabu search algorithm for self-healing ring network design. ⋮ Network disconnection problems in a centralized network ⋮ An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Decision support system for planning telecommunication networks: a case study applied to the Andalusian region ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ Quantifying optimal mesh and ring design costs ⋮ Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works ⋮ Design of stacked self-healing rings using a genetic algorithm ⋮ Algorithms for the design of network topologies with balanced disjoint rings ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Approximation Algorithms for the Black and White Traveling Salesman Problem ⋮ Connectivity-splitting models for survivable network design ⋮ Improved Formulations for the Ring Spur Assignment Problem ⋮ Operations research applications: Opportunities and accomplishments ⋮ Heuristics for the black and white traveling salesman problem

This page was built for software: SONET