A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.
Hans KellererPublished in: RANDOM-APPROX (1999)
Keyphrases
- polynomial time approximation
- knapsack problem
- np hard
- approximation algorithms
- combinatorial optimization problems
- error bounds
- optimization problems
- optimal solution
- exact algorithms
- minimum cost
- multidimensional knapsack problem
- dynamic programming
- special case
- scheduling problem
- computational complexity
- greedy heuristic
- integer programming
- greedy algorithm
- lower bound
- production planning
- neural network
- cutting plane
- linear programming relaxation
- bin packing
- linear programming
- worst case