A hierarchical algorithm for the planar single-facility location routing problem.
S. M. H. Manzour-al-AjdadS. Ali TorabiSaïd SalhiPublished in: Comput. Oper. Res. (2012)
Keyphrases
- detection algorithm
- learning algorithm
- dynamic programming
- preprocessing
- k means
- computational cost
- worst case
- knapsack problem
- cost function
- optimal solution
- genetic algorithm
- linear programming
- linear combination
- computational complexity
- tree structure
- single facility
- np hard
- expectation maximization
- matching algorithm
- steady state