Approximation Algorithms for Constrained Knapsack Problems
Glencora BorradaileBrent HeeringaGordon T. WilfongPublished in: CoRR (2009)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- optimal solution
- combinatorial optimization problems
- special case
- worst case
- minimum cost
- linear programming relaxation
- dynamic programming
- vertex cover
- test problems
- network design problem
- optimization problems
- approximation ratio
- constant factor
- set cover
- disjoint paths
- computational complexity
- integer programming
- open shop
- linear programming
- lower bound
- randomized algorithms
- primal dual
- production planning
- scheduling problem
- cutting plane
- approximation schemes
- maximum profit
- precedence constraints
- linear program
- constraint satisfaction problems
- evolutionary algorithm
- binary variables
- combinatorial auctions
- greedy algorithm
- metaheuristic
- learning algorithm