Improved approximation algorithms and disjunctive relaxations for some knapsack problems.
Yuri FaenzaIgor MalinovicPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- linear programming relaxation
- optimal solution
- special case
- combinatorial optimization problems
- minimum cost
- lower bound
- scheduling problem
- linear programming
- worst case
- test problems
- integer programming
- set cover
- approximation ratio
- production planning
- facility location problem
- vertex cover
- network design problem
- greedy heuristic
- open shop
- lp relaxation
- binary variables
- constraint satisfaction problems
- primal dual
- constant factor
- dynamic programming
- cutting plane
- branch and bound algorithm
- linear program
- approximation guarantees
- polynomial time approximation
- greedy algorithms
- randomized algorithms
- objective function