Professor, School of Mathematical Sciences
Faculty of Exact Sciences, Tel Aviv University
Email: segevdanny@tauex.tau.ac.il
and Visiting Scholar (sabbatical 2026/27), IEOR Department
School of Engineering and Applied Science, Columbia University
Mathematical aspects of optimization: Stochastic, dynamic, combinatorial.
Algorithmic revenue management: Assortment planning, inventory control, dynamic pricing, resource allocation, matching platforms.
Appeared / Accepted (2026+)
Noga Alon and Danny Segev. New approximation guarantees for the inventory staggering problem. Operations Research (forthcoming).
Danny Segev. Near-optimal dynamic policies for joint replenishment in continuous/discrete time. Mathematics of Operations Research (forthcoming).
Danny Segev and Sahil Singla. Efficient approximation schemes for stochastic probing and selection-stopping problems. Mathematics of Operations Research (forthcoming).
Danny Segev. Improved approximation guarantees for joint replenishment in continuous time. Mathematics of Operations Research, 51(2):1683-1712, 2026.
Theo Barre, Omar El Housni, Marouane Ibn Brahim, Andrea Lodi, and Danny Segev. Assortment optimization with visibility constraints. Mathematical Programming, 216:177-220, 2026.
Omar El Housni, Marouane Ibn Brahim, and Danny Segev. Maximum load assortment optimization: Approximation algorithms and adaptivity gaps. Operations Research, 74(1):408-429, 2026.
Guillermo Gallego and Danny Segev. A prophet inequality based approach to the adaptive ProbeTopK problem. Mathematical Programming, 215:57-93, 2026.
In review / Working papers
Danny Segev. Resource-constrained joint replenishment via power-of-m^{1/k} policies.
Danny Segev. Economic warehouse lot scheduling: Breaking the 2-approximation barrier.
Danny Segev. Economic warehouse lot scheduling: Approximation schemes via efficiently-representable DP-encoded policies.
Danny Segev and Uri Stein. Approximation schemes for sequential hiring problems.
Danny Hermelin, Danny Segev, and Dvir Shabtay. Approximation algorithms for fair repetitive scheduling.
Danny Segev and Gidi Steinberg. Improved approximation guarantees and hardness results for MNL-driven product ranking.
Xingxing Chen, Levi DeValve, Jacob Feldman, Yukai Huang, and Danny Segev. Approximation schemes for dynamic pricing with opaque products.
Dan Nissim, Danny Segev, and Alfredo Torrico. Revenue maximization in choice-based matching markets.
Aviya Goldstein Feder and Danny Segev. Dynamic assortment optimization of horizontally-differentiated products: Improved approximations and universal constructions.
Particularly interesting topics
Danny Segev. Near-optimal adaptive policies for serving stochastically departing customers. Operations Research, 73(5):2744-2760, 2025.
Ali Aouad, Jacob Feldman, Danny Segev, and Dennis Zhang. Click-based MNL: Algorithmic frameworks for modeling click data in assortment optimization. Management Science, 71(8):6943-6960, 2025.
Jacob Feldman and Danny Segev. Dynamic pricing with menu costs: Approximation schemes and applications to grocery retail. Manufacturing & Service Operations Management, 27(4):1087–1106, 2025.
Danny Segev. The continuous-time joint replenishment problem: ε-optimal policies via pairwise alignment. Management Science, 71(5):4183-4197, 2025.
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.
Ali Aouad and Danny Segev. An approximate dynamic programming approach to the incremental knapsack problem. Operations Research, 71(4):1414-1433, 2023.
Ali Aouad, Jacob Feldman, and Danny Segev. The Exponomial choice model for assortment optimization: An alternative to the MNL model? Management Science, 69(5):2814-2832, 2023.
Ali Aouad and Danny Segev. The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications. Operations Research, 71(4):1216-1249, 2023.
Yuri Faenza, Danny Segev, and Lingyi Zhang. Approximation algorithms for the generalized incremental knapsack problem. Mathematical Programming, 198:27-83, 2023.
Danny Segev. Approximation schemes for capacity-constrained assortment optimization under the Nested Logit model. Operations Research, 70(5):2820-2836, 2022.
Jacob Feldman and Danny Segev. The Multinomial Logit model with sequential offerings: Algorithmic frameworks for product recommendation displays. Operations Research, 70(4):2162-2184, 2022.
Danny Segev and Yaron Shaposhnik. A polynomial-time approximation scheme for sequential batch-testing of series systems. Operations Research, 70(2):1153-1165, 2022.
Antoine Desir, Vineet Goyal, Srikanth Jagabathula, and Danny Segev. Mallows-smoothed distribution over rankings approach for modeling choice. Operations Research, 69(4):1206-1227, 2021.
Ali Aouad and Danny Segev. Display optimization for vertically differentiated locations under Multinomial Logit choice preferences. Management Science, 67(6): 3519-3550, 2020.
Antoine Desir, Vineet Goyal, Danny Segev, and Chun Ye. Capacity constrained assortment optimization under the Markov chain based choice model. Management Science, 66(2):698-721, 2020.
Associate editor, Operations Research (Optimization area)
Associate editor, Management Science (Market Design, Platform, and Demand Analytics department)