Valid inequalities for the routing and spectrum allocation problem in elastic optical networks.
Miroslaw KlinkowskiMichal PioaroMateusz ZotkiewiczMarc RuizLuis VelascoPublished in: ICTON (2014)
Keyphrases
- valid inequalities
- optical networks
- wavelength division multiplexing
- link failure
- integer programming
- traveling salesman problem
- service differentiation
- linear programming
- mixed integer
- mixed integer programming
- cutting plane
- feasible solution
- lower and upper bounds
- convex hull
- column generation
- wdm networks
- routing problem
- integer program
- network design problem
- primal dual
- routing and wavelength assignment
- routing algorithm
- continuous variables
- ad hoc networks
- routing protocol
- lagrangian relaxation
- network topology
- wireless networks
- facet defining inequalities
- ant colony optimization
- linear program
- lower bound
- social networks
- wireless ad hoc networks
- network technologies
- upper bound
- dynamic programming
- objective function