Retsef Levi

MIT Sloan School of Management - Operations Research Center

Robert N. Noyce Career Development Professor

77 Massachusetts Ave.

E62-416

Cambridge, MA 02142

United States

SCHOLARLY PAPERS

6

DOWNLOADS
Rank 34,339

SSRN RANKINGS

Top 34,339

in Total Papers Downloads

962

CITATIONS

1

Scholarly Papers (6)

1.

Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources

MIT Sloan Research Paper No. 4702-08
Number of pages: 27 Posted: 07 May 2008
Retsef Levi and Ana Radovanovic
MIT Sloan School of Management - Operations Research Center and IBM - T. J. Watson Research Center
Downloads 81 (224,211)

Abstract:

Revenue Management, Linear Programming, Approximation Algorithms, Asymptotic Optimality

2.

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand

Operations Research, Forthcoming, MIT Sloan Research Paper No. 5139-15
Number of pages: 32 Posted: 26 Mar 2015 Last Revised: 14 Aug 2015
Vineet Goyal, Retsef Levi and Danny Segev
Columbia University - Department of Industrial Engineering and Operations Research (IEOR), MIT Sloan School of Management - Operations Research Center and University of Haifa - Department of Statistics
Downloads 53 (204,941)
Citation 1

Abstract:

assortment planning, dynamic substitution, polynomial time approximation schemes

3.

Assortment Optimization Under Consider-Then-Choose Choice Models

Number of pages: 48 Posted: 17 Jun 2015 Last Revised: 10 Nov 2016
Ali Aouad, Vivek F. Farias and Retsef Levi
Massachusetts Institute of Technology (MIT) - Operations Research Center, Massachusetts Institute of Technology (MIT) - Sloan School of Management and MIT Sloan School of Management - Operations Research Center
Downloads 51 (82,732)

Abstract:

Assortment optimization, dynamic programming, choice models, consider-then-choose

4.

The Approximability of Assortment Optimization Under Ranking Preferences

Number of pages: 18 Posted: 03 Jun 2015 Last Revised: 25 Oct 2016
Massachusetts Institute of Technology (MIT) - Operations Research Center, Massachusetts Institute of Technology (MIT) - Sloan School of Management, MIT Sloan School of Management - Operations Research Center and University of Haifa - Department of Statistics
Downloads 41 (149,473)

Abstract:

Assortment optimization, choice models, hardness of approximation, independent set, approximation algorithms

5.

Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences

Number of pages: 54 Posted: 05 Sep 2015 Last Revised: 24 Oct 2016
Ali Aouad, Retsef Levi and Danny Segev
Massachusetts Institute of Technology (MIT) - Operations Research Center, MIT Sloan School of Management - Operations Research Center and University of Haifa - Department of Statistics
Downloads 24 (141,726)

Abstract:

assortment planning, dynamic substitution, approximation algorithms, submodularity.

6.

Approximation Algorithms for Dynamic Assortment Optimization Models

Number of pages: 36 Posted: 08 Aug 2015 Last Revised: 06 Nov 2016
Ali Aouad, Retsef Levi and Danny Segev
Massachusetts Institute of Technology (MIT) - Operations Research Center, MIT Sloan School of Management - Operations Research Center and University of Haifa - Department of Statistics
Downloads 21 (152,015)

Abstract:

Assortment Planning, Inventory Management, Choice Models, Dynamic Optimization, Approximation Algorithms, Submodularity