Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
DOI10.1007/S10288-016-0309-ZzbMATH Open1351.90159OpenAlexW2304370196MaRDI QIDQ295887FDOQ295887
Authors: Christophe Duhamel, Philippe Mahey, Rodney R. Saldanha, Maurício C. de Souza, Alexandre X. Martins
Publication date: 14 June 2016
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-016-0309-z
Recommendations
- On column generation formulations for the RWA problem
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks
- Solving the Static Design Routing and Wavelength Assignment Problem
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- The complexity of path coloring and call scheduling
- Routing and wavelength assignment by partition colouring
- On column generation formulations for the RWA problem
- The permutation-path coloring problem on trees.
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Routing and wavelength assignment in optical networks using bin packing based algorithms
Cited In (13)
- Routing and wavelength assignment in all-optical networks based on the bee colony optimization
- Routing and wavelength assignment by partition colouring
- Integer programming models for the routing and spectrum allocation problem
- Towards optimal and scalable solution for routing and spectrum allocation
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
- On column generation formulations for the RWA problem
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A column generation technique for routing and spectrum allocation in cloud-ready survivable elastic optical networks
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
- Solving the routing and wavelength assignment problem with conflict-driven ASP solvers
- A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
This page was built for publication: Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295887)