Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming.
Daniel BienstockJay SethuramanChun YePublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- combinatorial optimization problems
- minimum cost
- vertex cover
- optimal solution
- special case
- worst case
- scheduling problem
- approximation ratio
- dynamic programming
- multidimensional knapsack problem
- linear programming relaxation
- optimization problems
- network design problem
- primal dual
- production planning
- linear programming
- lower bound
- greedy algorithm
- computational complexity
- integer programming
- open shop
- maximum profit
- branch and bound algorithm
- constant factor
- cutting plane
- randomized algorithms
- set cover
- greedy heuristic
- implicit enumeration
- constant factor approximation
- undirected graph
- linear program
- greedy algorithms
- constraint satisfaction problems
- genetic algorithm