Green Large-Scale Fog Computing Resource Allocation Using Joint Benders Decomposition, Dinkelbach Algorithm, ADMM, and Branch-and-Bound.
Ye YuXiangyuan BuKai YangZhikun WuZhu HanPublished in: IEEE Internet Things J. (2019)
Keyphrases
- resource allocation
- branch and bound
- optimal solution
- network design problem
- search space
- computational complexity
- lower bound
- branch and bound procedure
- cost function
- np hard
- exact algorithms
- benders decomposition
- search strategy
- depth first search
- simulated annealing
- upper bound
- shortest path
- particle swarm optimization
- branch and bound algorithm
- mixed integer
- linear programming
- objective function