Improved approximation algorithms for a bilevel knapsack problem.
Xian QiuWalter KernPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- implicit enumeration
- linear programming
- optimal solution
- combinatorial optimization problems
- special case
- vertex cover
- dynamic programming
- minimum cost
- integer programming
- set cover
- worst case
- network design problem
- greedy heuristic
- scheduling problem
- multidimensional knapsack problem
- greedy algorithm
- optimization problems
- constraint satisfaction problems
- linear programming relaxation
- lower bound
- primal dual
- production planning
- branch and bound algorithm
- polynomial time approximation
- approximation ratio
- randomized algorithms
- open shop
- undirected graph
- constant factor
- lagrangian relaxation
- linear program
- computational complexity