A New Fully Polynomial Approximation Scheme for the Knapsack Problem.
Hans KellererUlrich PferschyPublished in: APPROX (1998)
Keyphrases
- knapsack problem
- polynomial approximation
- combinatorial optimization problems
- pointwise
- lower bound
- np hard
- optimal solution
- optimization problems
- dynamic programming
- exact algorithms
- linear programming relaxation
- bicriteria
- multidimensional knapsack problem
- facet model
- greedy algorithm
- confidence intervals
- monte carlo
- machine learning
- robust estimators
- implicit enumeration