Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients
Valentin E. BrimkovStefan S. DantchevPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- knapsack problem
- approximation algorithms
- np hard
- lower bound
- exact algorithms
- linear programming relaxation
- optimal solution
- worst case
- combinatorial optimization problems
- integrality gap
- upper bound
- minimum cost
- constant factor
- branch and bound algorithm
- cutting plane
- set cover
- scheduling problem
- special case
- vertex cover
- integer programming
- greedy heuristic
- multidimensional knapsack problem
- objective function
- optimization problems
- primal dual
- randomized algorithms
- network design problem
- linear programming
- constraint satisfaction problems
- lagrangian relaxation
- branch and bound
- approximation ratio
- approximation guarantees
- dynamic programming
- strongly np hard
- computational complexity
- binary variables
- metaheuristic
- error bounds
- polynomial time approximation
- disjoint paths
- implicit enumeration
- genetic algorithm
- maximum profit