An Efficient Algorithm for the Knapsack Sharing Problem.
Mhand HifiSlim SadfiAbdelkader SbihiPublished in: Comput. Optim. Appl. (2002)
Keyphrases
- dynamic programming
- experimental evaluation
- computational cost
- cost function
- optimal solution
- computational complexity
- detection algorithm
- high accuracy
- objective function
- selection algorithm
- significant improvement
- similarity measure
- k means
- np hard
- times faster
- segmentation algorithm
- memory efficient
- convex hull
- tree structure
- preprocessing
- expectation maximization
- search space
- optimization algorithm
- theoretical analysis
- path planning
- particle swarm optimization
- recognition algorithm
- worst case
- improved algorithm
- single pass
- probabilistic model