Pages that link to "Item:Q856305"
From MaRDI portal
The following pages link to Routing and wavelength assignment in optical networks using bin packing based algorithms (Q856305):
Displaying 13 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)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks (Q511724) (← links)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands (Q2255944) (← links)
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths (Q2628203) (← links)
- Shortest node-disjoint paths on random graphs (Q3301996) (← links)
- Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)
- Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem (Q6495886) (← links)
