A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree Problem.
Roberto CordoneMarco TrubianPublished in: Asia Pac. J. Oper. Res. (2008)
Keyphrases
- dynamic programming
- optimal solution
- detection algorithm
- computational complexity
- experimental evaluation
- high accuracy
- computational cost
- learning algorithm
- optimization algorithm
- significant improvement
- search space
- cost function
- preprocessing
- worst case
- maximum flow
- segmentation algorithm
- ant colony optimization
- path planning
- times faster
- knapsack problem
- minimum spanning tree
- neural network
- weighted distance
- optimal path
- graph structure
- recognition algorithm
- greedy algorithm
- tree structure
- linear programming
- objective function
- image sequences