A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications.
Retsef LeviGeorgia PerakisGonzalo RomeroPublished in: Oper. Res. Lett. (2014)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- optimal solution
- combinatorial optimization problems
- piecewise linear
- special case
- minimum cost
- quadratic program
- worst case
- vertex cover
- approximation ratio
- production planning
- optimization problems
- lower bound
- dynamic programming
- randomized algorithms
- scheduling problem
- linear programming relaxation
- multidimensional knapsack problem
- greedy algorithm
- integer programming
- linear programming
- convex hull
- network design problem
- cutting plane
- branch and bound algorithm
- primal dual
- combinatorial auctions
- disjoint paths
- greedy heuristic
- convex optimization
- maximum profit
- precedence constraints
- lagrangian relaxation
- lp relaxation
- linear program
- machine learning
- constant factor approximation