Matheuristics for solving the Multiple Knapsack Problem with Setup.
Rahma LahyaniKhalil ChebilMahdi KhemakhemLeandro C. CoelhoPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- knapsack problem
- implicit enumeration
- combinatorial optimization problems
- optimal solution
- randomly generated test instances
- optimization problems
- test problems
- dynamic programming
- linear relaxation
- multiple objectives
- lp relaxation
- combinatorial optimization
- np hard
- multidimensional knapsack problem
- linear programming relaxation
- bicriteria
- greedy algorithm
- production planning
- exact algorithms
- objective function
- heuristic solution
- constrained optimization
- decision variables
- np hard problems
- dna computing
- cutting plane
- integer variables
- evolutionary algorithm
- maximum profit
- branch and bound algorithm