Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
Evelia LizárragaMaria J. BlesaChristian BlumPublished in: EvoCOP (2017)
Keyphrases
- knapsack problem
- randomly generated test instances
- multi dimensional
- vehicle routing problem
- optimization problems
- dynamic programming
- combinatorial optimization problems
- optimal solution
- continuous relaxation
- implicit enumeration
- integer variables
- metaheuristic
- np hard
- exact algorithms
- greedy algorithm
- constrained problems
- bicriteria
- linear programming relaxation
- multidimensional knapsack problem
- cutting plane
- lp relaxation
- integer program
- decision variables
- evolutionary algorithm
- neural network
- combinatorial optimization
- simulated annealing
- high dimensional
- genetic algorithm