The maximum diversity assortment selection problem
Year of publication: |
2021
|
---|---|
Authors: | Prause, Felix ; Hoppmann-Baum, Kai ; Defourny, Boris ; Koch, Thorsten |
Published in: |
Mathematical methods of operations research : ZOR. - Berlin : Springer, ISSN 1432-5217, ZDB-ID 1459420-1. - Vol. 93.2021, 3, p. 521-554
|
Subject: | Combinatorial optimization | Mixed integer programming | Two-dimensional knapsack problem | Maximum diversity problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Grids for cutting and packing problems : a study in the 2D knapsack problem
Cunha, Jéssica Gabriela de Almeida, (2020)
-
Maximum weighted induced forests and trees : new formulations and a computational comparative review
Melo, Rafael A., (2022)
-
Decomposition branching for mixed integer programming
Yıldız, Barış, (2022)
- More ...
-
The maximum diversity assortment selection problem
Prause, Felix, (2021)
-
Optimal information blending with measurements in the L2 sphere
Defourny, Boris, (2015)
-
Optimal learning in linear regression with combinatorial feature selection
Han, Bin, (2016)
- More ...