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 | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
A graph-based approach for relating integer programs
Steever, Zachary, (2024)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
- More ...
-
The maximum diversity assortment selection problem
Prause, Felix, (2021)
-
Defourny, Boris, (2018)
-
Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning
Defourny, Boris, (2013)
- More ...