Publications

Some Older Publications

Google Scholar, SSRN, DBLP, arXiv

Selected Recent Publications

Dynamic assortment optimization...

• Vineet Goyal, Retsef Levi, and Danny Segev. Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. Operations Research, 64(1):219-235, 2016.

• Danny Segev. Assortment planning with nested preferences: Dynamic programming with distributions as states? Algorithmica, 81(1):393-417, 2019.

• Ali Aouad, Retsef Levi, and Danny Segev. Approximation algorithms for dynamic assortment optimization models. Mathematics of Operations Research, 44(2):487-511, 2019.

• Ali Aouad, Retsef Levi, and Danny Segev. Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Operations Research, 66(5):1321-1345, 2018. This paper was a 2016 Nicholson Prize finalist.

• [NEW] Ali Aouad and Danny Segev. The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications. In submission to Operations Research.

Static assortment optimization, product ranking, ...

• 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. This paper was a 2015 Nicholson Prize finalist.

• Ali Aouad, Vivek Farias, Retsef Levi, and Danny Segev. The approximability of assortment optimization under ranking preferences. Operations Research, 66(6):1661-1669, 2018.

• Ali Aouad and Danny Segev. Display optimization for vertically differentiated locations under multinomial logit choice preferences. Management Science (forthcoming).

• Antoine Desir, Vineet Goyal, Srikanth Jagabathula, and Danny Segev. Mallows-smoothed distribution over rankings approach for modeling choice. Operations Research (forthcoming).

• Ali Aouad, Jacob Feldman, and Danny Segev. The Exponomial choice model: Assortment optimization and application to public transit choice prediction in San Francisco. In submission to Operations Research.

• [NEW] Ali Aouad, Jacob Feldman, Danny Segev, and Dennis Zhang. Click-based MNL: Algorithmic frameworks for modeling click data in assortment optimization. In submission to Management Science.

• [NEW] Jacob Feldman and Danny Segev. Improved approximation schemes for MNL-driven sequential assortment optimization. In submission to Operations Research.

• [NEW] Danny Segev. Approximation Schemes for Capacity-Constrained Assortment Optimization under the Nested Logit Model. In submission to Operations Research.

Inventory theory, scheduling, sequential testing, and additional cool stuff

• Danny Segev. An approximate dynamic programming approach to the joint replenishment problem. Mathematics of Operations Research, 39(2):432-444, 2014.

• Retsef Levi, Thomas Magnanti, Jack Muckstadt, Danny Segev, and Eric Zarybnisky. Maintenance scheduling for modular systems: Modeling and algorithms. Naval Research Logistics, 61(6):472-488, 2014. This paper was awarded the 2016 Harold W. Kuhn prize.

• Rebi Daldal, Iftah Gamzu, Danny Segev, and Tonguc Unluyurt. Approximation algorithms for sequential batch-testing of series systems. Naval Research Logistics, 63(4):275-286, 2016.

• Iftah Gamzu and Danny Segev. A sublogarithmic approximation for tollbooth pricing on trees. Mathematics of Operations Research, 42(2):377-388, 2017.

• Lennart Baardman, Maxime Cohen, Kiran Panchamgam, Georgia Perakis, and Danny Segev. Scheduling promotion vehicles to boost profits. Management Science, 65(1):50-70, 2019. This paper was awarded the 2016 INFORMS best cluster paper prize (service science section).

• Ali Aouad and Danny Segev. The ordered k-median problem: Surrogate models and approximation algorithms. Mathematical Programming, 177(1-2):55-83, 2019.

• Danny Segev and Yaron Shaposhnik. A polynomial-time approximation scheme for sequential batch-testing of series systems. Operations Research (forthcoming).

• [NEW] Refael Hassin, R. Ravi, F. Sibel Salman, and Danny Segev. The approximability of multiple facility location on directed networks with random arc failures. Algorithmica, 82:2474-2501, 2020.

• [NEW] Danny Segev and Sahil Singla. Efficient approximation schemes for stochastic probing and prophet problems. Working paper, 2020.

• [NEW] Yuri Faenza, Danny Segev, and Lingyi Zhang. Approximation algorithms for the generalized incremental knapsack problem. Working paper, 2020.