A polynomial algorithm for the two-connections variant of the tree p-median problem.
Philippe ChrétiennePublished in: Discret. Optim. (2014)
Keyphrases
- tree structure
- preprocessing
- detection algorithm
- segmentation algorithm
- improved algorithm
- dynamic programming
- optimization algorithm
- np hard
- polynomially bounded
- neural network
- high accuracy
- binary tree
- matching algorithm
- ant colony optimization
- linear programming
- experimental evaluation
- significant improvement
- search algorithm
- similarity measure
- computational cost
- theoretical analysis
- search space
- computational complexity
- optimal solution
- learning algorithm
- pruning algorithm
- tree construction
- genetic algorithm