Approximation algorithms for a bi-level knapsack problem.
Lin ChenGuochuan ZhangPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- bi level
- approximation algorithms
- knapsack problem
- np hard
- optimal solution
- gray scale
- exact algorithms
- combinatorial optimization problems
- worst case
- vertex cover
- special case
- minimum cost
- greedy heuristic
- lower bound
- optimization problems
- greedy algorithm
- branch and bound algorithm
- linear programming relaxation
- linear programming
- scheduling problem
- randomized algorithms
- approximation ratio
- cutting plane
- primal dual
- linear program
- constraint satisfaction problems
- integer programming
- implicit enumeration
- constant factor approximation
- greedy algorithms
- network design problem
- lagrangian relaxation
- dynamic programming
- computational complexity
- network flow
- co occurrence
- maximum profit