Prause, Felix; Hoppmann-Baum, Kai; Defourny, Boris; … - In: Mathematical Methods of Operations Research 93 (2021) 3, pp. 521-554
In this article, we introduce the Maximum Diversity Assortment Selection Problem (MDASP), which is a generalization of the two-dimensional Knapsack Problem (2D-KP). Given a set of rectangles and a rectangular container, the goal of 2D-KP is to determine a subset of rectangles that can be placed...