A branch and cut algorithm for hub location problems with single assignment.
Martine LabbéHande YamanÉric GourdinPublished in: Math. Program. (2005)
Keyphrases
- dynamic programming
- location problems
- k means
- learning algorithm
- cost function
- worst case
- optimal solution
- computational complexity
- detection algorithm
- simulated annealing
- expectation maximization
- np hard
- upper bound
- np complete
- evolutionary algorithm
- metaheuristic
- resource allocation
- convex hull
- hybrid algorithm
- space complexity
- preprocessing
- single facility