On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints.
Luigi De GiovanniFederico Della CroceRoberto TadeiPublished in: Networks (2004)
Keyphrases
- network design problem
- mixed integer
- internet protocol
- valid inequalities
- mixed integer programming
- approximation algorithms
- network design
- minimal cost
- integer programming
- tcp ip
- branch and bound
- cutting plane
- convex hull
- transportation networks
- lp relaxation
- lagrangian relaxation
- exact solution
- feasible solution
- constraint programming
- special case
- ip networks
- lot sizing
- communication networks
- evolutionary algorithm
- worst case
- optimal solution