default search action
Retsef Levi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Retsef Levi
, Thomas L. Magnanti
Scheduling with Testing of Heterogeneous Jobs. Manag. Sci. 70(5): 2934-2953 (2024) - [i4]Retsef Levi, Elisabeth Paulson, Georgia Perakis, Emily Zhang:
Heterogeneous Treatment Effects in Panel Data. CoRR abs/2406.05633 (2024) - 2022
- [j36]Retsef Levi
Artificial Shortage in Agricultural Supply Chains. Manuf. Serv. Oper. Manag. 24(2): 746-765 (2022) - [i3]Kevin Hu, Retsef Levi, Raphael Yahalom, El Ghali Zerhouni:
Supply Chain Characteristics as Predictors of Cyber Risk: A Machine-Learning Assessment. CoRR abs/2210.15785 (2022) - 2021
- [j35]Cangyu Jin
Testing at the Source: Analytics-Enabled Risk-Based Sampling of Food Supply Chains in China. Manag. Sci. 67(5): 2985-2996 (2021) - [j34]Ali Aouad
Assortment Optimization Under Consider-Then-Choose Choice Models. Manag. Sci. 67(6): 3368-3386 (2021) - [c11]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: 130-131 - 2020
- [j33]Retsef Levi
Economically Motivated Adulteration in Farming Supply Chains. Manag. Sci. 66(1): 209-226 (2020) - [i2]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 abs/2006.06373 (2020)
2010 – 2019
- 2019
- [j32]Retsef Levi
Near-Optimality of Uniform Copayments for Subsidies and Taxes Allocation Problems. Oper. Res. 67(2): 548-561 (2019) - [j31]Retsef Levi
Scheduling with Testing. Manag. Sci. 65(2): 776-793 (2019) - [j30]Ali Aouad
Approximation Algorithms for Dynamic Assortment Optimization Models. Math. Oper. Res. 44(2): 487-511 (2019) - 2018
- [j29]Ali Aouad
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. Oper. Res. 66(5): 1321-1345 (2018) - [j28]Ali Aouad
The Approximability of Assortment Optimization Under Ranking Preferences. Oper. Res. 66(6): 1661-1669 (2018) - 2017
- [j27]Retsef Levi, Georgia Perakis, Gonzalo Romero:
On the Effectiveness of Uniform Subsidies in Increasing Market Consumption. Manag. Sci. 63(1): 40-57 (2017) - [j26]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): 256-276 (2017) - 2016
- [j25]Vineet Goyal, Retsef Levi, Danny Segev:
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. Oper. Res. 64(1): 219-235 (2016) - [j24]Adam N. Elmachtoub
Supply Chain Management with Online Customer Selection. Oper. Res. 64(2): 458-473 (2016) - [j23]Maurice Cheung, Adam N. Elmachtoub
The submodular joint replenishment problem. Math. Program. 158(1-2): 207-233 (2016) - 2015
- [j22]Retsef Levi, Georgia Perakis, Joline Uichanco
The Data-Driven Newsvendor Problem: New Bounds and Insights. Oper. Res. 63(6): 1294-1306 (2015) - [j21]Adam N. Elmachtoub
From Cost Sharing Mechanisms to Online Selection Problems. Math. Oper. Res. 40(3): 542-557 (2015) - [i1]Retsef Levi, Cong Shi:
Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation. CoRR abs/1505.03774 (2015) - 2014
- [j20]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): 445-460 (2014) - [j19]Philipp W. Keller, Retsef Levi, Georgia Perakis:
Efficient formulations for pricing under attraction demand models. Math. Program. 145(1-2): 223-261 (2014) - [j18]Retsef Levi, Georgia Perakis, Gonzalo Romero:
A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications. Oper. Res. Lett. 42(5): 367-373 (2014) - 2013
- [j17]Retsef Levi, Cong Shi
Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times. Oper. Res. 61(3): 593-602 (2013) - [j16]Niv Buchbinder
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61(4): 1014-1029 (2013) - [j15]Retsef Levi, Liron Yedidsion:
NP-hardness proof for the assembly problem with stationary setup and additive holding costs. Oper. Res. Lett. 41(2): 134-137 (2013) - 2012
- [j14]Mehmet A. Begen
Technical Note - A Sampling-Based Approach to Appointment Scheduling. Oper. Res. 60(3): 675-681 (2012) - [j13]Retsef Levi, David B. Shmoys
LP-based approximation algorithms for capacitated facility location. Math. Program. 131(1-2): 365-379 (2012) - 2011
- [j12]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): 929-941 (2011) - [j11]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): 85-106 (2011) - 2010
- [j10]Retsef Levi, Ana Radovanovic:
Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources. Oper. Res. 58(2): 503-507 (2010)
2000 – 2009
- 2008
- [j9]Retsef Levi, Robin Roundy, David B. Shmoys
Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. 56(5): 1184-1199 (2008) - [j8]Retsef Levi, Robin Roundy, David B. Shmoys
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. 54(4): 763-776 (2008) - [j7]Retsef Levi, Ganesh Janakiraman
A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales. Math. Oper. Res. 33(2): 351-374 (2008) - [j6]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): 461-474 (2008) - [j5]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): 34:1-34:17 (2008) - [c10]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA 2008: 952-961 - 2007
- [j4]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. 32(2): 284-302 (2007) - [j3]Retsef Levi, Robin Roundy, David B. Shmoys
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models. Math. Oper. Res. 32(4): 821-839 (2007) - [c9]Retsef Levi, Andrea Lodi, Maxim Sviridenko:
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO 2007: 454-468 - 2006
- [j2]Retsef Levi, Robin Roundy, David B. Shmoys
Primal-Dual Algorithms for Deterministic Inventory Problems. Math. Oper. Res. 31(2): 267-284 (2006) - [c8]Retsef Levi, Maxim Sviridenko:
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. APPROX-RANDOM 2006: 188-199 - [c7]Retsef Levi, Robin Roundy, David B. Shmoys
Provably near-optimal sampling-based algorithms for Stochastic inventory control models. STOC 2006: 739-748 - 2005
- [j1]Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. 7(1): 81-99 (2005) - [c6]Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys:
Inventory and Facility Location Models with Market Selection. IPCO 2005: 111-124 - [c5]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. IPCO 2005: 306-320 - [c4]Retsef Levi, Robin Roundy, David B. Shmoys
A constant approximation algorithm for the one-warehouse multi-retailer problem. SODA 2005: 365-374 - 2004
- [c3]Retsef Levi, David B. Shmoys, Chaitanya Swamy:
LP-based Approximation Algorithms for Capacitated Facility Location. IPCO 2004: 206-218 - [c2]David B. Shmoys
Facility location with Service Installation Costs. SODA 2004: 1088-1097 - [c1]Retsef Levi, Robin Roundy, David B. Shmoys
Primal-dual algorithms for deterministic inventory problems. STOC 2004: 353-362
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: