Lagrangian relaxation for maximum service in multicast routing with QoS constraints.
Carlos Victor Dantas AraújoCid Carvalho de SouzaFábio Luiz UsbertiPublished in: Int. Trans. Oper. Res. (2024)
Keyphrases
- lagrangian relaxation
- multicast routing
- capacity constraints
- quality of service
- lower and upper bounds
- web services
- service selection
- integer programming
- lower bound
- ip networks
- feasible solution
- network resources
- qos requirements
- branch and bound algorithm
- qos aware
- np hard
- linear programming
- dynamic programming
- column generation
- multicast tree
- end to end delay
- constraint programming
- dual variables
- service oriented
- service composition
- resource management
- shortest path
- response time
- real time
- wireless mesh networks
- tabu search
- upper bound