Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
Milind DawandeJayant KalagnanamPinar KeskinocakF. Sibel SalmanR. RaviPublished in: J. Comb. Optim. (2000)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- special case
- vertex cover
- combinatorial optimization problems
- worst case
- minimum cost
- optimal solution
- open shop
- set cover
- optimization problems
- primal dual
- multidimensional knapsack problem
- approximation ratio
- production planning
- objective function
- implicit enumeration
- greedy algorithm
- computational complexity
- integer programming
- lower bound
- constant factor
- linear programming relaxation
- scheduling problem
- greedy algorithms
- greedy heuristic
- genetic algorithm
- dynamic programming
- network design problem
- cutting plane
- linear programming
- branch and bound
- branch and bound algorithm
- undirected graph