Approximation Algorithms for the Weight-Reducible Knapsack Problem.
Marc GoerigkYogish SabharwalAnita SchöbelSandeep SenPublished in: TAMC (2014)
Keyphrases
- constraint programming
- constraint satisfaction problems
- knapsack problem
- approximation algorithms
- np hard
- optimal solution
- combinatorial optimization problems
- minimum cost
- special case
- integer programming
- scheduling problem
- lower bound
- set cover
- exact algorithms
- vertex cover
- network design problem
- worst case
- greedy heuristic
- multidimensional knapsack problem
- precedence constraints
- approximation ratio
- primal dual
- linear programming relaxation
- computational complexity
- greedy algorithms
- linear programming
- constant factor
- branch and bound algorithm
- disjoint paths
- upper bound
- constant factor approximation
- production planning
- maximum profit
- linear program
- cutting plane
- quadratic program
- evolutionary algorithm
- polynomial time approximation
- randomized algorithms
- undirected graph
- lagrangian relaxation