A logarithmic descent direction algorithm for the quadratic knapsack problem.
Zhengtian WuBaoping JiangHamid Reza KarimiPublished in: Appl. Math. Comput. (2020)
Keyphrases
- dynamic programming
- computational cost
- objective function
- experimental study
- matching algorithm
- optimal solution
- computational complexity
- search space
- significant improvement
- cost function
- np hard
- times faster
- recognition algorithm
- segmentation method
- detection algorithm
- theoretical analysis
- computationally efficient
- high accuracy
- worst case
- k means
- data sets
- hardware implementation
- single pass
- memory requirements
- tree structure
- preprocessing
- similarity measure