On the approximability of the two-phase knapsack problem.
Kameng NipZhenbo WangPublished in: J. Comb. Optim. (2019)
Keyphrases
- genetic algorithm
- knapsack problem
- combinatorial optimization problems
- optimization problems
- multidimensional knapsack problem
- optimal solution
- np hard
- dynamic programming
- approximation algorithms
- evolutionary algorithm
- test problems
- multi objective
- cutting plane
- linear programming relaxation
- np hard problems
- exact algorithms
- production planning
- greedy heuristic
- multiple objectives
- bicriteria
- greedy algorithm
- decision variables
- maximum profit
- special case
- randomly generated test instances
- worst case
- heuristic solution
- cost function
- traveling salesman problem
- constraint satisfaction problems
- scheduling problem