An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems.
Eitan ZemelPublished in: Inf. Process. Lett. (1984)
Keyphrases
- related problems
- optimization algorithm
- np hard
- improved algorithm
- preprocessing
- detection algorithm
- linear complexity
- objective function
- cost function
- learning algorithm
- closed form
- clustering method
- experimental evaluation
- ant colony optimization
- computational cost
- data sets
- computational complexity
- similarity measure
- high accuracy
- theoretical analysis
- segmentation algorithm
- dynamic programming
- k means
- search space
- optimal solution
- piecewise linear
- genetic algorithm