Danny Segev

Office: Rabin Complex, room 8047

Research Themes

My current research broadly focuses on the design of algorithms whose performance guarantees are provably good, i.e., admit a rigorous mathematical analysis showing that the computational method in question indeed identifies optimal solutions, or in some cases, near-optimal ones. I am especially interested in real-life problems that have practical importance, yet leave plenty of room for theoretical investigations.

Applications: Inventory, assortment planning, pricing, bioinformatics, optimization in statistical theory, telecommunications. 
 
Theory: Stochastic optimization, applied probability, scheduling, choice modeling, facility location, network design, matching.

Techniques: Approximate dynamic programming, submodular functions, randomization, mathematical programming, polyhedral combinatorics, graph theory.

Academic Background

GRADUATED FROM ...
School of Mathematical Sciences, Tel-Aviv University
Adviser:
Prof. Refael Hassin

THEN MOVED TO ...
Algorithms and Complexity Group
Department of Computer Science, Carnegie Mellon University


AND THEN TO ...
Sloan School of Management, Massachusetts Institute of Technology

Publications (partial list): Google Scholar, SSRN, DBLP, arXiv

Selected Recent Publications:

Dynamic assortment planning...

Static assortment planning...

Inventory theory, scheduling, and sequential testing...

Additional cool stuff that doesn't fit into the items above...

Internal Links

Teaching 2017/18