Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
From MaRDI portal
(Redirected from Publication:306092)
Recommendations
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths
- Routing and wavelength assignment by partition colouring
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
Cites work
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Fibonacci heaps and their uses in improved network optimization algorithms
- Global optimization method for finding dense packings of equal circles in a circle
- ILP formulations for the routing and wavelength assignment problem: symmetric systems
- Iterated tabu search for the circular open dimension problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- On column generation formulations for the RWA problem
- Routing and wavelength assignment by partition colouring
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu search with simple ejection chains for coloring graphs
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
Cited in
(3)
This page was built for publication: Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306092)