Danny Segev
School of Mathematical Sciences, Tel-Aviv University
and Coller School of Management (by courtesy)
Email: segevdanny@tauex.tau.ac.il
School of Mathematical Sciences, Tel-Aviv University
and Coller School of Management (by courtesy)
Email: segevdanny@tauex.tau.ac.il
Mathematical aspects of optimization: Stochastic, dynamic, combinatorial.
Computational/analytical revenue management: Assortment planning, inventory control, pricing, scheduling.
Appeared / Accepted
Jacob Feldman and Danny Segev. Dynamic pricing with menu costs: Approximation schemes and applications to grocery retail. Manufacturing & Service Operations Management (forthcoming).
Omar El Housni, Marouane Ibn Brahim, and Danny Segev. Maximum load assortment optimization: Approximation algorithms and adaptivity gaps. Operations Research (forthcoming).
Guillermo Gallego and Danny Segev. A constructive prophet inequality approach to the adaptive ProbeMax problem. Mathematical Programming (forthcoming).
Danny Segev. Near-optimal adaptive policies for serving stochastically departing customers. Operations Research (forthcoming).
Danny Segev. The continuous-time joint replenishment problem: eps-optimal policies via pairwise alignment. Management Science (forthcoming).
Ali Aouad, Jacob Feldman, Danny Segev, and Dennis Zhang. Click-based MNL: Algorithmic frameworks for modeling click data in assortment optimization. Management Science (forthcoming).
Yicheng Bai, Jacob Feldman, Danny Segev, Huseyin Topaloglu, and Laura Wagner. Assortment optimization under the multi-purchase Multinomial Logit choice model. Operations Research, 72(6):2631-2664, 2024.
Alon Rieger and Danny Segev. Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Mathematical Programming, 208:111-171, 2024.
In review / Working papers
Danny Segev. New approximation guarantees for the economic warehouse lot scheduling problem. Working paper.
Dan Nissim, Danny Segev, and Alfredo Torrico. Revenue maximization in choice-based matching markets. Working paper.
Danny Segev. Improved approximation guarantees for joint replenishment in continuous time. In submission to Mathematics of Operations Research.
Theo Barre, Omar El Housni, Marouane Ibn Brahim, Andrea Lodi, and Danny Segev. Assortment optimization with visibility constraints. In submission to Mathematical Programming.
Aviya Goldstein Feder and Danny Segev. Dynamic assortment optimization of horizontally-differentiated products: Improved approximations and universal constructions. In submission to Operations Research.
Danny Segev and Sahil Singla. Efficient approximation schemes for stochastic probing and prophet problems. In submission to Mathematics of Operations Research.