An approximation scheme for the two-stage, two-dimensional knapsack problem.
Alberto CapraraAndrea LodiMichele MonaciPublished in: Discret. Optim. (2010)
Keyphrases
- knapsack problem
- polynomial time approximation
- np hard
- combinatorial optimization problems
- linear programming relaxation
- optimization problems
- test problems
- greedy algorithm
- exact algorithms
- dynamic programming
- optimal solution
- approximation schemes
- heuristic solution
- multidimensional knapsack problem
- bicriteria
- approximation algorithms
- three dimensional
- continuous relaxation
- randomized approximation
- multiple objectives
- np hard problems
- lower bound
- special case
- integer variables
- implicit enumeration
- bayesian networks
- greedy heuristic
- cutting plane
- branch and bound algorithm
- maximum profit