A Lower Time Bound for the Knapsack Problem on Random Access Machines.
Peter KleinFriedhelm Meyer auf der HeidePublished in: Acta Informatica (1983)
Keyphrases
- knapsack problem
- random access
- combinatorial optimization problems
- dynamic programming
- optimal solution
- exact algorithms
- optimization problems
- multidimensional knapsack problem
- disk storage
- multiview video coding
- memory size
- solid state
- lower bound
- upper bound
- linear programming relaxation
- greedy algorithm
- np hard
- bicriteria
- worst case
- integer variables
- data structure
- image coding algorithm
- greedy heuristic
- parallel processors
- evolutionary algorithm
- hard disk
- flash memory
- image compression
- linear program