Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints.
Luigi De GiovanniRoberto TadeiPublished in: Networks (2007)
Keyphrases
- internet protocol
- neighborhood search
- network design problem
- end to end
- network design
- ip networks
- mixed integer
- traveling salesman problem
- valid inequalities
- communication networks
- tcp ip
- simulated annealing
- mixed integer programming
- mobility management
- routing protocol
- wireless networks
- ip addresses
- ad hoc networks
- routing algorithm
- integer programming
- optimal solution
- approximation algorithms
- lagrangian relaxation
- routing problem
- feasible solution
- linear program
- metaheuristic
- optimization problems
- evolutionary algorithm