Lagrangean decomposition/relaxation for the routing and wavelength assignment problem.
Babacar ThionganePublished in: Networks (2012)
Keyphrases
- optimal solution
- routing problem
- wavelength division multiplexing
- decomposition method
- routing protocol
- probabilistic relaxation
- objective function
- inter domain
- routing algorithm
- upper bound
- lower bound
- infrared
- network topology
- column generation
- mobile ad hoc networks
- optical burst switching
- feasible solution
- lagrangean relaxation
- special case
- facility location problem
- decomposition algorithm
- iterative algorithms
- lagrangian relaxation
- shortest path
- linear programming relaxation
- genetic algorithm