A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint.
Zhou XuXiaofan LaiPublished in: WADS (2011)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- decision variables
- dynamic programming
- optimal solution
- optimization problems
- integer variables
- test problems
- np hard
- exact algorithms
- np hard problems
- greedy algorithm
- multidimensional knapsack problem
- linear programming relaxation
- continuous relaxation
- multiple objectives
- bicriteria
- machine learning
- greedy heuristic
- heuristic solution
- evolutionary algorithm
- single machine
- cutting plane
- special case