Retsef Levi

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 19

Top Topics

Multinomial Logit

Knapsack Problem

Approximation Algorithms

Top Venues

Math. Oper. Res.

Publications

Retsef Levi, Thomas L. Magnanti, Yaron Shaposhnik
Scheduling with Testing of Heterogeneous Jobs. Manag. Sci. 70 (5) (2024)
Retsef Levi, Elisabeth Paulson, Georgia Perakis, Emily Zhang
Heterogeneous Treatment Effects in Panel Data. CoRR (2024)
Retsef Levi, Somya Singhvi, Yanchong Zheng
Artificial Shortage in Agricultural Supply Chains. Manuf. Serv. Oper. Manag. 24 (2) (2022)
Kevin Hu, Retsef Levi, Raphael Yahalom, El Ghali Zerhouni
Supply Chain Characteristics as Predictors of Cyber Risk: A Machine-Learning Assessment. CoRR (2022)
Cangyu Jin, Retsef Levi, Qiao Liang, Nicholas Renegar, Stacy Springs, Jiehong Zhou, Weihua Zhou
Testing at the Source: Analytics-Enabled Risk-Based Sampling of Food Supply Chains in China. Manag. Sci. 67 (5) (2021)
Ali Aouad, Vivek F. Farias, Retsef Levi
Assortment Optimization Under Consider-Then-Choose Choice Models. Manag. Sci. 67 (6) (2021)
Jackie Baek, Vivek F. Farias, Andreea Georgescu, Retsef Levi, Tianyi Peng, Deeksha Sinha, Joshua Wilde, Andrew Zheng
The Limits to Learning a Diffusion Model. EC (2021)
Jackie Baek, Vivek F. Farias, Andreea Georgescu, Retsef Levi, Tianyi Peng, Deeksha Sinha, Joshua Wilde, Andrew Zheng
The Limits to Learning an SIR Process: Granular Forecasting for Covid-19. CoRR (2020)
Retsef Levi, Somya Singhvi, Yanchong Zheng
Economically Motivated Adulteration in Farming Supply Chains. Manag. Sci. 66 (1) (2020)
Retsef Levi, Thomas L. Magnanti, Yaron Shaposhnik
Scheduling with Testing. Manag. Sci. 65 (2) (2019)
Retsef Levi, Georgia Perakis, Gonzalo Romero
Near-Optimality of Uniform Copayments for Subsidies and Taxes Allocation Problems. Oper. Res. 67 (2) (2019)
Ali Aouad, Retsef Levi, Danny Segev
Approximation Algorithms for Dynamic Assortment Optimization Models. Math. Oper. Res. 44 (2) (2019)
Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev
The Approximability of Assortment Optimization Under Ranking Preferences. Oper. Res. 66 (6) (2018)
Ali Aouad, Retsef Levi, Danny Segev
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. Oper. Res. 66 (5) (2018)
Retsef Levi, Georgia Perakis, Gonzalo Romero
On the Effectiveness of Uniform Subsidies in Increasing Market Consumption. Manag. Sci. 63 (1) (2017)
Retsef Levi, Robin Roundy, Van-Anh Truong, Xinshang Wang
Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models. Math. Oper. Res. 42 (1) (2017)
Vineet Goyal, Retsef Levi, Danny Segev
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. Oper. Res. 64 (1) (2016)
Adam N. Elmachtoub, Retsef Levi
Supply Chain Management with Online Customer Selection. Oper. Res. 64 (2) (2016)
Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys
The submodular joint replenishment problem. Math. Program. 158 (1-2) (2016)
Retsef Levi, Cong Shi
Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation. CoRR (2015)
Adam N. Elmachtoub, Retsef Levi
From Cost Sharing Mechanisms to Online Selection Problems. Math. Oper. Res. 40 (3) (2015)
Retsef Levi, Georgia Perakis, Joline Uichanco
The Data-Driven Newsvendor Problem: New Bounds and Insights. Oper. Res. 63 (6) (2015)
Retsef Levi, Georgia Perakis, Gonzalo Romero
A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications. Oper. Res. Lett. 42 (5) (2014)
Assaf Avrahami, Yale T. Herer, Retsef Levi
Matching Supply and Demand: Delayed Two-Phase Distribution at Yedioth Group - Models, Algorithms, and Information Technology. Interfaces 44 (5) (2014)
Philipp W. Keller, Retsef Levi, Georgia Perakis
Efficient formulations for pricing under attraction demand models. Math. Program. 145 (1-2) (2014)
Retsef Levi, Liron Yedidsion
NP-hardness proof for the assembly problem with stationary setup and additive holding costs. Oper. Res. Lett. 41 (2) (2013)
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61 (4) (2013)
Retsef Levi, Cong Shi
Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times. Oper. Res. 61 (3) (2013)
Retsef Levi, David B. Shmoys, Chaitanya Swamy
LP-based approximation algorithms for capacitated facility location. Math. Program. 131 (1-2) (2012)
Mehmet A. Begen, Retsef Levi, Maurice Queyranne
Technical Note - A Sampling-Based Approach to Appointment Scheduling. Oper. Res. 60 (3) (2012)
Woonghee Tim Huh, Retsef Levi, Paat Rusmevichientong, James B. Orlin
Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator. Oper. Res. 59 (4) (2011)
Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys
Approximation algorithms for supply chain planning and logistics problems with market choice. Math. Program. 130 (1) (2011)
Retsef Levi, Ana Radovanovic
Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources. Oper. Res. 58 (2) (2010)
Retsef Levi, Robin Roundy, David B. Shmoys, Van-Anh Truong
Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. 56 (5) (2008)
Retsef Levi, Andrea Lodi, Maxim Sviridenko
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities. Math. Oper. Res. 33 (2) (2008)
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA (2008)
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4 (3) (2008)
Retsef Levi, Ganesh Janakiraman, Mahesh Nagarajan
A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales. Math. Oper. Res. 33 (2) (2008)
Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. 54 (4) (2008)
Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. 32 (2) (2007)
Retsef Levi, Andrea Lodi, Maxim Sviridenko
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO (2007)
Retsef Levi, Robin Roundy, David B. Shmoys
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models. Math. Oper. Res. 32 (4) (2007)
Retsef Levi, Robin Roundy, David B. Shmoys
Primal-Dual Algorithms for Deterministic Inventory Problems. Math. Oper. Res. 31 (2) (2006)
Retsef Levi, Robin Roundy, David B. Shmoys
Provably near-optimal sampling-based algorithms for Stochastic inventory control models. STOC (2006)
Retsef Levi, Maxim Sviridenko
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. APPROX-RANDOM (2006)
Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
Approximation Algorithms for Stochastic Inventory Control Models. IPCO (2005)
Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. 7 (1) (2005)
Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
Inventory and Facility Location Models with Market Selection. IPCO (2005)
Retsef Levi, Robin Roundy, David B. Shmoys
A constant approximation algorithm for the one-warehouse multi-retailer problem. SODA (2005)
Retsef Levi, Robin Roundy, David B. Shmoys
Primal-dual algorithms for deterministic inventory problems. STOC (2004)
David B. Shmoys, Chaitanya Swamy, Retsef Levi
Facility location with Service Installation Costs. SODA (2004)
Retsef Levi, David B. Shmoys, Chaitanya Swamy
LP-based Approximation Algorithms for Capacitated Facility Location. IPCO (2004)