Approximation algorithms on 0-1 linear knapsack problem with a single continuous variable.
Chenxia ZhaoXianyue LiPublished in: J. Comb. Optim. (2014)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- continuous variables
- integer variables
- constant factor approximation
- network design problem
- special case
- combinatorial optimization problems
- vertex cover
- optimal solution
- worst case
- optimization problems
- dynamic systems
- primal dual
- minimum cost
- branch and bound algorithm
- greedy algorithm
- scheduling problem
- quadratic program
- linear programming relaxation
- dynamic programming
- lower bound
- constant factor
- computationally expensive
- mixed integer
- greedy heuristic
- bayesian networks
- random variables
- structure learning
- integer programming
- computational complexity
- genetic algorithm