Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem.
Michael M. GüntzerDieter JungnickelPublished in: Oper. Res. Lett. (2000)
Keyphrases
- recently developed
- neural network
- optimization problems
- real time
- exact and approximate
- computationally efficient
- semi supervised
- significant improvement
- data structure
- lower bound
- computational complexity
- computer vision
- benchmark datasets
- learning algorithm
- database
- greedy heuristic
- greedy algorithms
- constrained minimization