Pages that link to "Item:Q2628203"
From MaRDI portal
The following pages link to Solving routing and wavelength assignment problem with maximum edge-disjoint paths (Q2628203):
Displaying 14 items.
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks (Q511724) (← links)
- Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks (Q887850) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- Towards optimal and scalable solution for routing and spectrum allocation (Q1742253) (← links)
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid (Q2030326) (← links)
- A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands (Q2255944) (← links)
- The Maximum Disjoint Routing Problem (Q2817875) (← links)
- A post-optimization method to route scheduled lightpath demands with multiplicity (Q2883572) (← links)
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (Q2892159) (← links)
- Solving the Static Design Routing and Wavelength Assignment Problem (Q3085937) (← links)
- Approximation algorithms for constructing wavelength routing networks (Q4785217) (← links)
