Assortment planning for multiple chain stores
Year of publication: |
October 2018
|
---|---|
Authors: | Corsten, Hans ; Hopf, Michael ; Kasper, Benedikt ; Thielen, Clemens |
Published in: |
OR spectrum : quantitative approaches in management. - Berlin : Springer, ISSN 0171-6468, ZDB-ID 2073885-7. - Vol. 40.2018, 4, p. 875-912
|
Subject: | Retail management | Computational complexity | Approximation algorithms | Substitution | Mathematische Optimierung | Mathematical programming | Einzelhandel | Retail trade | Sortiment | Retail assortment | Algorithmus | Algorithm | Handelsmanagement | Theorie | Theory | Handelskette | Retail chain |
-
An efficient algorithm for capacitated assortment planning with stochastic demand and substitution
Gübner, Alexander, (2016)
-
Decision support algorithm development for assortment optimization in the retail chain
Iurasova, Olga, (2025)
-
Assortment optimization over time
Fonseca, José da, (2015)
- More ...
-
Competitive algorithms for multistage online scheduling
Hopf, Michael, (2017)
-
Multistage interval scheduling games
Herzel, Arne, (2019)
-
The quadratic shortest path problem : complexity, approximability, and solution methods
Rostami, Borzou, (2018)
- More ...