Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds.
Andranik MirzaianPublished in: Networks (1985)
Keyphrases
- lagrangian relaxation
- lower and upper bounds
- worst case
- np hard
- lower bound
- dynamic programming
- optimal solution
- learning algorithm
- integer programming
- search space
- cost function
- computational complexity
- simulated annealing
- energy function
- data structure
- relaxation algorithm
- convergence rate
- approximation algorithms
- branch and bound search