GRASP for WDM network design problem with traffic grooming.
Xinyun WuZhipeng LüQi GuoTao YePublished in: ICNC (2014)
Keyphrases
- network design problem
- transportation networks
- mesh network
- network design
- wavelength division multiplexing
- approximation algorithms
- branch and bound
- road network
- minimal cost
- routing and wavelength assignment
- blocking probability
- mixed integer programming
- traveling salesman problem
- integer programming
- wdm networks
- travel time
- traffic flow
- network traffic
- valid inequalities
- lagrangian relaxation
- optical networks
- mixed integer
- neural network
- mathematical model
- tabu search
- shortest path
- lower bound
- computational complexity