A New Approximation Algorithm for the d-dimensional Knapsack Problem Based on Hopfield Networks.
Hsin-Lung WuJui-Sheng ChangJen-Chun ChangPublished in: IIH-MSP (1) (2018)
Keyphrases
- knapsack problem
- optimal solution
- np hard
- dynamic programming
- exact algorithms
- cost function
- bicriteria
- hopfield networks
- learning algorithm
- combinatorial optimization problems
- approximation algorithms
- optimization algorithm
- simulated annealing
- search space
- computational complexity
- linear programming relaxation
- implicit enumeration
- mathematical model
- energy function
- computationally intensive
- convergence rate
- multidimensional knapsack problem
- worst case
- objective function