Pages that link to "Item:Q2892368"
From MaRDI portal
The following pages link to A traffic-grooming algorithm for wavelength-routed optical networks (Q2892368):
Displaying 13 items.
- Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators (Q286692) (← links)
- A global approach for designing reliable WDM networks and grooming the traffic (Q925825) (← links)
- The design of transparent optical networks minimizing the impact of critical nodes (Q1742217) (← links)
- Call blocking probabilities in a traffic-groomed tandem optical network (Q1886025) (← links)
- On minimum congestion routing in rearrangeable multihop lightwave networks (Q1922634) (← links)
- Multiobjective swarm intelligence for the traffic grooming problem (Q2340529) (← links)
- An efficient heuristic to dimension large-scale hybrid optoelectronic networks (Q2581615) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- (Q3515387) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks (Q5505662) (← links)
- Computational Science – ICCS 2005 (Q5709467) (← links)
- Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)
