Retsef Levi
Orcid: 0000-0002-1994-4875
According to our database1,
Retsef Levi
authored at least 48 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2022
Supply Chain Characteristics as Predictors of Cyber Risk: A Machine-Learning Assessment.
CoRR, 2022
2021
Testing at the Source: Analytics-Enabled Risk-Based Sampling of Food Supply Chains in China.
Manag. Sci., 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
2020
2019
Math. Oper. Res., 2019
Oper. Res., 2019
2018
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.
Oper. Res., 2018
Oper. Res., 2018
2017
Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models.
Math. Oper. Res., 2017
Manag. Sci., 2017
2016
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand.
Oper. Res., 2016
2015
CoRR, 2015
2014
A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications.
Oper. Res. Lett., 2014
Math. Program., 2014
Matching Supply and Demand: Delayed Two-Phase Distribution at Yedioth Group - Models, Algorithms, and Information Technology.
Interfaces, 2014
2013
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
Oper. Res., 2013
2012
Math. Program., 2012
Oper. Res., 2012
2011
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
2010
Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources.
Oper. Res., 2010
2008
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
Math. Oper. Res., 2008
Manag. Sci., 2008
Oper. Res., 2008
2007
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models.
Math. Oper. Res., 2007
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
2006
Provably near-optimal sampling-based algorithms for Stochastic inventory control models.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Proceedings of the Approximation, 2006
2005
Manuf. Serv. Oper. Manag., 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004