Improved Swap Heuristic for the Multiple Knapsack Problem.
Yacine LaalaouiPublished in: IWANN (1) (2013)
Keyphrases
- knapsack problem
- optimal solution
- exact algorithms
- multidimensional knapsack problem
- heuristic solution
- greedy heuristic
- dynamic programming
- combinatorial optimization problems
- linear programming relaxation
- randomly generated test instances
- optimization problems
- test problems
- greedy algorithm
- np hard
- production planning
- maximum profit
- np hard problems
- combinatorial optimization
- graph cuts
- cutting plane
- linear programming
- approximation algorithms
- bicriteria
- lower bound
- machine learning
- lp relaxation
- continuous relaxation
- feasible solution