A lagrangian relaxation algorithm for facility location of resource-constrained decentralized multi-project scheduling problems.
Mohammad RostamiMorteza BagherpourPublished in: Oper. Res. (2020)
Keyphrases
- facility location
- relaxation algorithm
- resource constrained
- lagrangian relaxation
- scheduling problem
- np hard
- integer programming
- resource constraints
- feasible solution
- sensor networks
- lower bound
- branch and bound algorithm
- wireless sensor networks
- linear programming
- column generation
- tabu search
- dynamic programming
- lower and upper bounds
- multipath
- shortest path
- optimal solution
- approximation algorithms
- relaxation labeling
- regularized least squares
- branch and bound
- np complete
- multi criteria
- computational complexity
- embedded systems
- mixed integer
- special case
- neural network
- sensor nodes
- feature extraction