Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators.
Nawal BenabbouCassandre LeroyThibaut LustPublished in: ECAI (2020)
Keyphrases
- knapsack problem
- multi objective
- nsga ii
- implicit enumeration
- multiple objectives
- randomly generated test instances
- evolutionary algorithm
- optimization problems
- multi objective optimization
- optimization algorithm
- test problems
- linear relaxation
- objective function
- optimal solution
- combinatorial optimization problems
- minimax regret
- dynamic programming
- production planning
- linear programming relaxation
- lower bound
- np hard
- multi objective optimization problems
- greedy algorithm
- cutting plane
- utility elicitation
- particle swarm optimization
- genetic algorithm
- exact algorithms
- worst case
- combinatorial optimization
- search space
- multi objective evolutionary algorithms
- dna computing
- utility function