Narrow search
Showing 1 - 5 of 5
Cover Image
Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
Goyal, Vineet; Levi, Retsef; Segev, Danny - In: Operations research 64 (2016) 1, pp. 219-235
Persistent link: https://www.econbiz.de/10011447869
Cover Image
Mallows-smoothed distribution over rankings approach for modeling choice
Désir, Antoine; Goyal, Vineet; Jagabathula, Srikanth; … - In: Operations research 69 (2021) 4, pp. 1206-1227
Persistent link: https://www.econbiz.de/10012625180
Cover Image
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Aouad, Ali; Levi, Retsef; Segev, Danny - In: Operations research 66 (2018) 5, pp. 1321-1345
Persistent link: https://www.econbiz.de/10011932451
Cover Image
A polynomial-time approximation scheme for sequential batch testing of series systems
Segev, Danny; Shaposhnik, Yaron - In: Operations research 70 (2022) 2, pp. 1153-1165
Persistent link: https://www.econbiz.de/10013365868
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