Fast Enumeration of All Pareto-Optimal Solutions for 0-1 Multi-Objective Knapsack Problems Using ZDDs.
Hirofumi SuzukiShin-ichi MinatoPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2018)
Keyphrases
- pareto optimal solutions
- knapsack problem
- multi objective
- nsga ii
- evolutionary algorithm
- bi objective
- optimization problems
- dynamic programming
- optimal solution
- multi objective optimization
- pareto optimal
- test problems
- optimization algorithm
- objective function
- combinatorial optimization problems
- conflicting objectives
- multiobjective optimization
- multi objective optimization problems
- multi objective genetic algorithm
- genetic algorithm
- multiple objectives
- np hard
- particle swarm optimization
- multi objective evolutionary algorithms
- linear programming relaxation
- search space
- greedy algorithm
- linear programming
- pareto optimal set
- neural network
- crossover operator
- mutation operator
- special case
- strength pareto evolutionary algorithm