Approximation algorithms for fractional knapsack problems.
Alain BillionnetPublished in: Oper. Res. Lett. (2002)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- optimal solution
- combinatorial optimization problems
- special case
- minimum cost
- vertex cover
- test problems
- primal dual
- scheduling problem
- dynamic programming
- production planning
- lower bound
- linear programming relaxation
- approximation ratio
- optimization problems
- worst case
- open shop
- greedy heuristic
- network design problem
- integer programming
- linear programming
- constraint satisfaction problems
- branch and bound algorithm
- approximation schemes
- computational complexity
- set cover
- precedence constraints
- constant factor
- undirected graph
- disjoint paths
- maximum profit
- binary variables
- linear program
- quadratic program
- randomized algorithms
- combinatorial auctions
- constant factor approximation