Narrow search
Showing 1 - 10 of 13
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
The approximability of assortment optimization under ranking preferences
Aouad, Ali; Farias, Vivek; Levi, Retsef; Segev, Danny - In: Operations research 66 (2018) 6, pp. 1661-1669
Persistent link: https://www.econbiz.de/10011971731
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
Technical note - approximation schemes for capacity-constrained assortment optimization under the nested logit model
Segev, Danny - In: Operations research 70 (2022) 5, pp. 2820-2836
Persistent link: https://www.econbiz.de/10014307124
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
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: the multinomial logit model with sequential offerings : algorithmic frameworks for product recommendation displays
Feldman, Jacob; Segev, Danny - In: Operations research 70 (2022) 4, pp. 2162-2184
Persistent link: https://www.econbiz.de/10013366439
Cover Image
The stability of mnl-based demand under dynamic customer substitution and its algorithmic implications
Aouad, Ali; Segev, Danny - In: Operations research 71 (2023) 4, pp. 1216-1249
Persistent link: https://www.econbiz.de/10014338163
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
Technical note : a sampling-based approach to appointment scheduling
Begen, Mehmet A.; Levi, Retsef; Queyranne, Maurice - In: Operations research 60 (2012) 3, pp. 675-681
Persistent link: https://www.econbiz.de/10009575340