Approximation schemes for knapsack problems with shelf divisions.
E. C. XavierFlávio Keidi MiyazawaPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- approximation schemes
- knapsack problem
- approximation algorithms
- np hard
- combinatorial optimization problems
- optimal solution
- optimization problems
- dynamic programming
- test problems
- exact algorithms
- production planning
- numerical methods
- greedy algorithm
- cutting plane
- linear programming relaxation
- bin packing
- multiscale
- worst case
- special case
- implicit enumeration
- partial differential equations
- metaheuristic
- higher order
- denoising
- image analysis
- computational complexity
- search algorithm
- error metrics
- maximum profit