This paper discusses the bi-objective multi-dimensional knapsack problem. We propose the refinement of the core concept that has already effectively been used in the single objective multi-dimensional knapsack. The core concept is based on the divide and conquer principle. Instead of solving the...

In this article we introduce robustness measures in the context of multi-objective integer linear programming problems. The proposed measures are in line with the concept of decision robustness, which considers the uncertainty with respect to the implementation of a specific solution. An...