Dr. Danny Segev

Danny

 

 

 

 

 

Ph.D., Tel-Aviv University, 2007

Rabin building, Room: 8047

+972-4-8249238 (3238)

This email address is being protected from spambots. You need JavaScript enabled to view it.

Personal website

Danny

 

 

 

 

 

Ph.D., Tel-Aviv University, 2007

Rabin building, Room: 8047

+972-4-8249238 (3238)

This email address is being protected from spambots. You need JavaScript enabled to view it.

Personal website

Short Bio

Danny Segev is a senior faculty member in the Department of Statistics at the University of Haifa. He received a Ph.D. degree from the School of Mathematical Sciences at Tel-Aviv University, and held visiting positions in the Department of Computer Science at Carnegie Mellon University as well as in the Operations Research Center at MIT. Danny's current research broadly focuses on the design of algorithmic ideas and analytical methods whose performance guarantees are provably good, with an emphasis on real-life problems that have practical importance, yet leave plenty of room for theoretical investigations. These include optimization problems and computational issues in assortment planning, inventory management, bioinformatics, statistical theory, scheduling, location, and graph theory.

Research interests

  • Applications: Inventory, assortment planning, pricing, bioinformatics, optimization in statistical theory, telecommunications.
  • Theory: Stochastic optimization, choice modeling, applied probability, scheduling, facility location, network design, matching.
  • Techniques: Approximate dynamic programming, submodular functions, randomization, mathematical programming, polyhedral combinatorics, graph theory.

Selected 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 (forthcoming).
  • Ali Aouad, Retsef Levi, and Danny Segev. Approximation algorithms for dynamic assortment optimization models. Mathematics of Operations Research (forthcoming).
  • 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.

Static assortment optimization...

  • Antoine Desir, Vineet Goyal, Danny Segev, and Chun Ye. Capacity constrained assortment optimization under the markov chain based choice model. Management Science (forthcoming). 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 (forthcoming).
  • Ali Aouad and Danny Segev. Display optimization for vertically differentiated locations under multinomial logit choice preferences. In submission.
  • Antoine Desir, Vineet Goyal, Srikanth Jagabathula, and Danny Segev. Mallows-smoothed distribution over rankings approach for modeling choice. In submission. A preliminary version of this paper appeared in: Proceedings of the 29th Neural Information Processing Systems Conference, pages 4700-4708, 2016.
  • 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.

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 (forthcoming). 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 (forthcoming).
  • Danny Segev and Yaron Shaposhnik. A polynomial-time approximation scheme for sequential batch-testing of series systems. In submission.
ביה"ס לקרימינולוגיה, אוניברסיטת חיפה, הר הכרמל 31905 I בניין אשכול, קומה 23 I טלפון: 04-8288991

Search