Items where Author is "Segev, D"

Article
Aouad, A and Segev, D
(2023)
Technical Note - An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem.
Operations Research, 71 (4).
pp. 1414-1433.
ISSN 0030-364X
Aouad, A and Segev, D (2023) The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications. Operations Research, 71 (4). pp. 1216-1249. ISSN 0030-364X
Aouad, A, Feldman, J and Segev, D
(2023)
The exponomial choice model for assortment optimization: an alternative to the MNL model?
Management Science, 69 (5).
pp. 2814-2832.
ISSN 0025-1909
Aouad, A and Segev, D
(2021)
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences.
Management Science, 67 (6).
pp. 3519-3550.
ISSN 0025-1909
Aouad, A and Segev, D
(2019)
The ordered k-median problem: surrogate models and approximation algorithms.
Mathematical Programming, 177 (1-2).
pp. 55-83.
ISSN 0025-5610
Aouad, A, Levi, R and Segev, D
(2019)
Approximation algorithms for dynamic assortment optimization models.
Mathematics of Operations Research, 44 (2).
pp. 487-511.
ISSN 0364-765X
Aouad, A, Farias, V, Levi, R and Segev, D
(2018)
The Approximability of Assortment Optimization Under Ranking Preferences.
Operations Research, 66 (6).
pp. 1661-1669.
ISSN 0030-364X
Aouad, A, Levi, R and Segev, D
(2018)
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.
Operations Research, 66 (5).
pp. 1321-1345.
ISSN 0030-364X