Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method.
Xiaoling SunF. L. WangDuan LiPublished in: J. Glob. Optim. (2005)
Keyphrases
- dynamic programming
- knapsack problem
- high accuracy
- objective function
- computational cost
- preprocessing
- significant improvement
- detection algorithm
- recognition algorithm
- cost function
- optimization algorithm
- clustering method
- segmentation method
- segmentation algorithm
- computational complexity
- piecewise linear
- matching algorithm
- computational efficiency
- k means
- energy function
- similarity measure
- np hard
- combinatorial optimization
- test problems
- mathematical model
- learning algorithm
- optimization problems
- simulated annealing
- probabilistic model
- convergence rate
- search space
- heuristic methods
- error tolerance
- expectation maximization
- worst case
- multi objective
- approximation algorithms
- optimal solution
- clustering algorithm
- neural network
- regularized least squares