An Algorithm for Large Zero-One Knapsack Problems.
Egon BalasEitan ZemelPublished in: Oper. Res. (1980)
Keyphrases
- knapsack problem
- learning algorithm
- dynamic programming
- bicriteria
- computational complexity
- optimization algorithm
- detection algorithm
- np hard
- worst case
- particle swarm optimization
- exact algorithms
- simulated annealing
- probabilistic model
- convergence rate
- np hard problems
- integer linear programming
- neural network
- segmentation algorithm
- expectation maximization
- multi objective
- special case
- k means
- optimal solution
- objective function
- similarity measure
- machine learning