Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core.
George MavrotasJosé Rui FigueiraKostas FloriosPublished in: Appl. Math. Comput. (2009)
Keyphrases
- knapsack problem
- bi objective
- multi dimensional
- randomly generated test instances
- combinatorial optimization problems
- implicit enumeration
- multiple objectives
- optimal solution
- optimization problems
- greedy algorithm
- test problems
- np hard
- dynamic programming
- multidimensional knapsack problem
- efficient solutions
- exact algorithms
- integer variables
- nsga ii
- linear programming relaxation
- shortest path problem
- lp relaxation
- continuous relaxation
- maximum profit
- network design
- multi objective
- genetic algorithm
- combinatorial optimization