An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack
David PritchardPublished in: CoRR (2010)
Keyphrases
- integrality gap
- knapsack problem
- linear programming relaxation
- lp relaxation
- feasible solution
- linear program
- optimal solution
- linear programming
- dynamic programming
- arbitrarily close
- valid inequalities
- lower bound
- optimization problems
- np hard
- upper bound
- objective function
- integer programming
- integer programming formulation
- cutting plane
- branch and bound
- approximation algorithms
- primal dual
- production planning
- greedy algorithm
- message passing
- solution quality
- np hardness
- sample complexity
- integer program
- mixed integer programming
- branch and bound algorithm
- mathematical model
- metaheuristic