Narrow search
Showing 1 - 4 of 4
Cover Image
Technical note: an approximate dynamic programming approach to the incremental knapsack problem
Aouad, Ali; Segev, Danny - In: Operations research 71 (2023) 4, pp. 1414-1433
Persistent link: https://www.econbiz.de/10014338234
Cover Image
Approximation algorithms for dynamic assortment optimization models
Aouad, Ali; Levi, Retsef; Segev, Danny - In: Mathematics of operations research 44 (2019) 2, pp. 487-511
Persistent link: https://www.econbiz.de/10012028630
Cover Image
Assortment optimization under consider-then-choose choice models
Aouad, Ali; Farias, Vivek; Levi, Retsef - In: Management science : journal of the Institute for … 67 (2021) 6, pp. 3368-3386
Persistent link: https://www.econbiz.de/10012606900
Cover Image
The exponomial choice model for assortment optimization : an alternative to the mnl model?
Aouad, Ali; Feldman, Jacob; Segev, Danny - In: Management science : journal of the Institute for … 69 (2023) 5, pp. 2814-2832
Persistent link: https://www.econbiz.de/10014305442