Recombination of Similar Parents in SMS-EMOA on Many-Objective 0/1 Knapsack Problems.
Hisao IshibuchiNaoya AkedoYusuke NojimaPublished in: PPSN (2) (2012)
Keyphrases
- knapsack problem
- multiple objectives
- combinatorial optimization problems
- optimization problems
- test problems
- optimal solution
- np hard
- np hard problems
- building blocks
- dynamic programming
- exact algorithms
- search space
- production planning
- linear programming relaxation
- cutting plane
- binary variables
- mathematical model
- neural network
- metaheuristic
- special case
- bayesian networks