Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems.
George MavrotasJosé Rui FigueiraAlexandros AntoniadisPublished in: J. Glob. Optim. (2011)
Keyphrases
- knapsack problem
- bi objective
- exact solution
- multi dimensional
- exact algorithms
- optimal solution
- combinatorial optimization problems
- np hard
- multiple objectives
- test problems
- column generation
- lower bound
- greedy algorithm
- optimization problems
- nsga ii
- efficient solutions
- approximate solutions
- linear programming relaxation
- branch and bound
- dynamic programming
- search algorithm
- branch and bound algorithm
- objective function
- social networks