The following pages link to The SONET edge‐partition problem (Q4797943):
Displaying 15 items.
- On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Grooming traffic to minimize load (Q658091) (← links)
- A better approximation algorithm for the budget prize collecting tree problem. (Q703233) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. (Q1420448) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← links)
- Grooming in unidirectional rings: \(K_{4}-e\) designs (Q1876673) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
- Scheduling Personnel Retraining: Column Generation Heuristics (Q2835678) (← links)
- Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths (Q5191148) (← links)
- Approximation algorithms for the design of SDH/SONET networks (Q5479829) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
