Pages that link to "Item:Q1399114"
From MaRDI portal
The following pages link to SONET/SDH ring assignment with capacity constraints (Q1399114):
Displayed 16 items.
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- A ring-mesh topology design problem for optical transport networks (Q1009188) (← links)
- A tabu search algorithm for self-healing ring network design. (Q1410612) (← links)
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. (Q1420448) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks (Q2885521) (← links)
- Grooming for two-period optical networks (Q3548732) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
- Approximation algorithms for the design of SDH/SONET networks (Q5479829) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)