A branch and price algorithm for the capacitated ring tree problem.
Alessandro HillEdna Ayako HoshinoPublished in: CTW (2015)
Keyphrases
- tree structure
- np hard
- detection algorithm
- k means
- cost function
- experimental evaluation
- matching algorithm
- preprocessing
- search space
- computational cost
- learning algorithm
- optimization algorithm
- dynamic programming
- convergence rate
- expectation maximization
- simulated annealing
- worst case
- significant improvement
- binary tree
- single source
- probabilistic model
- minimum spanning tree
- computational complexity
- similarity measure