SONET

swMATH10644MaRDI QIDQ22603FDOQ22603

Author name not available (Why is that?)

Cited In (22)

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

This page was built for software: SONET