Approximation Algorithms for a Bi-level Knapsack Problem.
Lin ChenGuochuan ZhangPublished in: COCOA (2011)
Keyphrases
- approximation algorithms
- bi level
- knapsack problem
- np hard
- gray scale
- exact algorithms
- optimal solution
- combinatorial optimization problems
- special case
- vertex cover
- worst case
- cutting plane
- lower bound
- minimum cost
- scheduling problem
- dynamic programming
- greedy heuristic
- greedy algorithm
- randomized algorithms
- linear programming relaxation
- optimization problems
- branch and bound algorithm
- approximation ratio
- constraint satisfaction problems
- constant factor
- network design problem
- constant factor approximation
- primal dual
- undirected graph
- linear program
- linear programming
- precedence constraints
- binary variables
- integer programming
- greedy algorithms
- feasible solution
- computational complexity
- disjoint paths
- objective function