Article ID: | iaor20113695 |
Volume: | 49 |
Issue: | 4 |
Start Page Number: | 589 |
End Page Number: | 606 |
Publication Date: | Apr 2011 |
Journal: | Journal of Global Optimization |
Authors: | Mavrotas George, Figueira Rui, Antoniadis Alexandros |
Keywords: | programming: multiple criteria, programming: branch and bound, programming: integer |
We propose a methodology for obtaining the exact Pareto set of Bi‐Objective Multi‐Dimensional Knapsack Problems, exploiting the concept of core expansion. The core concept is effectively used in single objective multi‐dimensional knapsack problems and it is based on the ‘divide and conquer’ principle. Namely, instead of solving one problem with