Retsef Levi

According to our database1, Retsef Levi authored at least 41 papers between 2004 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Economically Motivated Adulteration in Farming Supply Chains.
Manag. Sci., 2020

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

Approximation Algorithms for Dynamic Assortment Optimization Models.
Math. Oper. Res., 2019

Scheduling with Testing.
Manag. Sci., 2019

Near-Optimality of Uniform Copayments for Subsidies and Taxes Allocation Problems.
Oper. Res., 2019

Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.
Oper. Res., 2018

The Approximability of Assortment Optimization Under Ranking Preferences.
Oper. Res., 2018

Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models.
Math. Oper. Res., 2017

On the Effectiveness of Uniform Subsidies in Increasing Market Consumption.
Manag. Sci., 2017

The submodular joint replenishment problem.
Math. Program., 2016

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

Supply Chain Management with Online Customer Selection.
Oper. Res., 2016

From Cost Sharing Mechanisms to Online Selection Problems.
Math. Oper. Res., 2015

The Data-Driven Newsvendor Problem: New Bounds and Insights.
Oper. Res., 2015

Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation.
CoRR, 2015

A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications.
Oper. Res. Lett., 2014

Efficient formulations for pricing under attraction demand models.
Math. Program., 2014

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

NP-hardness proof for the assembly problem with stationary setup and additive holding costs.
Oper. Res. Lett., 2013

Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times.
Oper. Res., 2013

Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms.
Oper. Res., 2013

LP-based approximation algorithms for capacitated facility location.
Math. Program., 2012

Technical Note - A Sampling-Based Approach to Appointment Scheduling.
Oper. Res., 2012

Approximation algorithms for supply chain planning and logistics problems with market choice.
Math. Program., 2011

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator.
Oper. Res., 2011

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

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
ACM Trans. Algorithms, 2008

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.
Math. Oper. Res., 2008

A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales.
Math. Oper. Res., 2008

A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem.
Manag. Sci., 2008

Approximation Algorithms for Capacitated Stochastic Inventory Control Models.
Oper. Res., 2008

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models.
Math. Oper. Res., 2007

Approximation Algorithms for Stochastic Inventory Control Models.
Math. Oper. Res., 2007

Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Primal-Dual Algorithms for Deterministic Inventory Problems.
Math. Oper. Res., 2006

Provably near-optimal sampling-based algorithms for Stochastic inventory control models.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.
Proceedings of the Approximation, 2006

The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners.
Manuf. Serv. Oper. Manag., 2005

A constant approximation algorithm for the one-warehouse multi-retailer problem.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Inventory and Facility Location Models with Market Selection.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Facility location with Service Installation Costs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004