Search Results - subject:"Maximum Diversity Problem"

The maximum diversity assortment selection problem

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...

Persistent link: https://www.econbiz.de/10014497496

The maximum diversity assortment selection problem

Prause, Felix; Hoppmann-Baum, Kai; Defourny, Boris; … - In: Mathematical methods of operations research : ZOR 93 (2021) 3, pp. 521-554

Persistent link: https://www.econbiz.de/10012589467

A note on heuristic approach based on UBQP formulation of the maximum diversity problem

Alidaee, Bahram; Wang, Haibo - In: Journal of the Operational Research Society : OR 68 (2017) 1, pp. 102-110

Persistent link: https://www.econbiz.de/10011656563

A hybrid metaheuristic method for the Maximum Diversity Problem

Wu, Qinghua; Hao, Jin-Kao - In: European Journal of Operational Research 231 (2013) 2, pp. 452-464

The Maximum Diversity Problem (MDP) consists in selecting a subset of m elements from a given set of n elements (n …

Persistent link: https://www.econbiz.de/10010682509