An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree.
Zhou XuXiaofan LaiAndrew LimFan WangPublished in: Networks (2014)
Keyphrases
- np hard
- optimal solution
- tree structure
- learning algorithm
- cost function
- computational complexity
- dynamic programming
- binary tree
- k means
- minimum spanning tree
- search space
- preprocessing
- expectation maximization
- optimization algorithm
- detection algorithm
- error bounds
- spanning tree
- benchmark problems
- knapsack problem
- particle swarm optimization
- matching algorithm
- ant colony optimization
- segmentation algorithm
- computational cost
- lower bound
- objective function
- decision trees