Retsef Levi

According to our database, Retsef Levi authored at least 46 papers between 2004 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Artificial Shortage in Agricultural Supply Chains.

Retsef Levi, Somya Singhvi, Yanchong Zheng

Manuf. Serv. Oper. Manag., 2022

Supply Chain Characteristics as Predictors of Cyber Risk: A Machine-Learning Assessment.

Kevin Hu, Retsef Levi, Raphael Yahalom, El Ghali Zerhouni

CoRR, 2022

2021

Testing at the Source: Analytics-Enabled Risk-Based Sampling of Food Supply Chains in China.

Cangyu Jin, Retsef Levi, Qiao Liang, Nicholas Renegar, Stacy L. Springs, Jiehong Zhou, Weihua Zhou

Manag. Sci., 2021

Assortment Optimization Under Consider-Then-Choose Choice Models.

Ali Aouad, Vivek F. Farias, Retsef Levi

Manag. Sci., 2021

The Limits to Learning a Diffusion Model.

Jackie Baek, Vivek F. Farias, Andreea Georgescu, Retsef Levi, Tianyi Peng, Deeksha Sinha, Joshua Wilde, Andrew Zheng

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Economically Motivated Adulteration in Farming Supply Chains.

Retsef Levi, Somya Singhvi, Yanchong Zheng

Manag. Sci., 2020

The Limits to Learning an SIR Process: Granular Forecasting for Covid-19.

Jackie Baek, Vivek F. Farias, Andreea Georgescu, Retsef Levi, Tianyi Peng, Deeksha Sinha, Joshua Wilde, Andrew Zheng

CoRR, 2020

2019

Approximation Algorithms for Dynamic Assortment Optimization Models.

Ali Aouad, Retsef Levi, Danny Segev

Math. Oper. Res., 2019

Scheduling with Testing.

Retsef Levi, Thomas L. Magnanti, Yaron Shaposhnik

Manag. Sci., 2019

Near-Optimality of Uniform Copayments for Subsidies and Taxes Allocation Problems.

Retsef Levi, Georgia Perakis, Gonzalo Romero

Oper. Res., 2019

2018

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

Ali Aouad, Retsef Levi, Danny Segev

Oper. Res., 2018

The Approximability of Assortment Optimization Under Ranking Preferences.

Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev

Oper. Res., 2018

2017

Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models.

Retsef Levi, Robin Roundy, Van-Anh Truong, Xinshang Wang

Math. Oper. Res., 2017

On the Effectiveness of Uniform Subsidies in Increasing Market Consumption.

Retsef Levi, Georgia Perakis, Gonzalo Romero

Manag. Sci., 2017

2016

The submodular joint replenishment problem.

Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys

Math. Program., 2016

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

Vineet Goyal, Retsef Levi, Danny Segev

Oper. Res., 2016

Supply Chain Management with Online Customer Selection.

Adam N. Elmachtoub, Retsef Levi

Oper. Res., 2016

2015

From Cost Sharing Mechanisms to Online Selection Problems.

Adam N. Elmachtoub, Retsef Levi

Math. Oper. Res., 2015

The Data-Driven Newsvendor Problem: New Bounds and Insights.

Retsef Levi, Georgia Perakis, Joline Uichanco

Oper. Res., 2015

Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation.

Retsef Levi, Cong Shi

CoRR, 2015

2014

A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications.

Retsef Levi, Georgia Perakis, Gonzalo Romero

Oper. Res. Lett., 2014

Efficient formulations for pricing under attraction demand models.

Philipp W. Keller, Retsef Levi, Georgia Perakis

Math. Program., 2014

Matching Supply and Demand: Delayed Two-Phase Distribution at Yedioth Group - Models, Algorithms, and Information Technology.

Assaf Avrahami, Yale T. Herer, Retsef Levi

Interfaces, 2014

2013

NP-hardness proof for the assembly problem with stationary setup and additive holding costs.

Retsef Levi, Liron Yedidsion

Oper. Res. Lett., 2013

Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times.

Retsef Levi, Cong Shi

Oper. Res., 2013

Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms.

Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko

Oper. Res., 2013

2012

LP-based approximation algorithms for capacitated facility location.

Retsef Levi, David B. Shmoys, Chaitanya Swamy

Math. Program., 2012

Technical Note - A Sampling-Based Approach to Appointment Scheduling.

Mehmet A. Begen, Retsef Levi, Maurice Queyranne

Oper. Res., 2012

2011

Approximation algorithms for supply chain planning and logistics problems with market choice.

Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys

Math. Program., 2011

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator.

Woonghee Tim Huh, Retsef Levi, Paat Rusmevichientong, James B. Orlin

Oper. Res., 2011

2010

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

Retsef Levi, Ana Radovanovic

Oper. Res., 2010

2008

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.

Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko

ACM Trans. Algorithms, 2008

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.

Retsef Levi, Andrea Lodi, Maxim Sviridenko

Math. Oper. Res., 2008

A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales.

Retsef Levi, Ganesh Janakiraman, Mahesh Nagarajan

Math. Oper. Res., 2008

A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem.

Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko

Manag. Sci., 2008

Approximation Algorithms for Capacitated Stochastic Inventory Control Models.

Retsef Levi, Robin Roundy, David B. Shmoys, Van-Anh Truong

Oper. Res., 2008

2007

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models.

Retsef Levi, Robin Roundy, David B. Shmoys

Math. Oper. Res., 2007

Approximation Algorithms for Stochastic Inventory Control Models.

Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys

Math. Oper. Res., 2007

Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.

Retsef Levi, Andrea Lodi, Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Primal-Dual Algorithms for Deterministic Inventory Problems.

Retsef Levi, Robin Roundy, David B. Shmoys

Math. Oper. Res., 2006

Provably near-optimal sampling-based algorithms for Stochastic inventory control models.

Retsef Levi, Robin Roundy, David B. Shmoys

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.

Retsef Levi, Maxim Sviridenko

Proceedings of the Approximation, 2006

2005

The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners.

Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze

Manuf. Serv. Oper. Manag., 2005

A constant approximation algorithm for the one-warehouse multi-retailer problem.

Retsef Levi, Robin Roundy, David B. Shmoys

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Inventory and Facility Location Models with Market Selection.

Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Facility location with Service Installation Costs.

David B. Shmoys, Chaitanya Swamy, Retsef Levi

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004