Year |
Citation |
Score |
2021 |
Aouad A, Farias V, Levi R. Assortment Optimization Under Consider-Then-Choose Choice Models Management Science. 67: 3368-3386. DOI: 10.1287/mnsc.2020.3681 |
0.355 |
|
2020 |
Levi R, Rajan M, Singhvi S, Zheng Y. The impact of unifying agricultural wholesale markets on prices and farmers' profitability. Proceedings of the National Academy of Sciences of the United States of America. 117: 2366-2371. PMID 31964822 DOI: 10.1073/Pnas.1906854117 |
0.317 |
|
2020 |
Levi R, Perakis G, Shi C, Sun W. Strategic Capacity Planning Problems in Revenue Sharing Joint Ventures Production and Operations Management. 29: 664-687. DOI: 10.1111/Poms.13128 |
0.423 |
|
2019 |
Aouad A, Levi R, Segev D. Approximation algorithms for dynamic assortment optimization models Mathematics of Operations Research. 44: 487-511. DOI: 10.2139/Ssrn.2641268 |
0.506 |
|
2019 |
Levi R, Perakis G, Romero G. Near-Optimality of Uniform Copayments for Subsidies and Taxes Allocation Problems Operations Research. 67: 548-561. DOI: 10.1287/Opre.2018.1785 |
0.399 |
|
2019 |
Levi R, Magnanti TL, Shaposhnik Y. Scheduling with Testing Management Science. 65: 776-793. DOI: 10.1287/Mnsc.2017.2973 |
0.383 |
|
2018 |
Aouad A, Levi R, Segev D. Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences Operations Research. 66: 1321-1345. DOI: 10.2139/Ssrn.2655759 |
0.479 |
|
2018 |
Aouad A, Farias VF, Levi R, Segev D. The Approximability of Assortment Optimization Under Ranking Preferences Operations Research. 66: 1661-1669. DOI: 10.2139/Ssrn.2612947 |
0.485 |
|
2017 |
Levi R, Roundy R, Truong VA, Wang X. Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models Mathematics of Operations Research. 42: 256-276. DOI: 10.1287/Moor.2016.0805 |
0.461 |
|
2017 |
Levi R, Perakis G, Romero G. On the Effectiveness of Uniform Subsidies in Increasing Market Consumption Management Science. 63: 40-57. DOI: 10.1287/Mnsc.2015.2329 |
0.417 |
|
2017 |
Chen Y, Levi R, Shi C. Revenue Management of Reusable Resources with Advanced Reservations Production and Operations Management. 26: 836-859. DOI: 10.1111/Poms.12672 |
0.374 |
|
2016 |
Elmachtoub AN, Levi R. Supply Chain Management with Online Customer Selection Operations Research. 64: 458-473. DOI: 10.1287/Opre.2015.1472 |
0.491 |
|
2016 |
Goyal V, Levi R, Segev D. Near-optimal algorithms for the assortment planning problem under dynamic substitution and Stochastic Demand Operations Research. 64: 219-235. DOI: 10.1287/Opre.2015.1450 |
0.505 |
|
2016 |
Cheung M, Elmachtoub AN, Levi R, Shmoys DB. The submodular joint replenishment problem Mathematical Programming. 158: 207-233. DOI: 10.1007/S10107-015-0920-3 |
0.688 |
|
2015 |
Levi R, Perakis G, Uichanco J. The Data-Driven Newsvendor Problem: New Bounds and Insights Operations Research. 63: 1294-1306. DOI: 10.1287/Opre.2015.1422 |
0.4 |
|
2015 |
Elmachtoub AN, Levi R. From Cost Sharing Mechanisms to Online Selection Problems Mathematics of Operations Research. 40: 542-557. DOI: 10.1287/Moor.2014.0684 |
0.503 |
|
2015 |
Cho P, Farias V, Kessler J, Levi R, Magnanti T, Zarybnisky E. Maintenance and flight scheduling of low observable aircraft Naval Research Logistics. 62: 60-80. DOI: 10.1002/Nav.21614 |
0.351 |
|
2014 |
Avrahami A, Herer YT, Levi R. Matching Supply and Demand: Delayed Two-Phase Distribution at Yedioth Group-Models, Algorithms, and Information Technology Interfaces. 44: 445-460. DOI: 10.1287/Inte.2014.0759 |
0.473 |
|
2014 |
Levi R, Perakis G, Romero G. A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications Operations Research Letters. 42: 367-373. DOI: 10.1016/J.Orl.2014.06.007 |
0.471 |
|
2014 |
Keller PW, Levi R, Perakis G. Efficient formulations for pricing under attraction demand models Mathematical Programming. 145: 223-261. DOI: 10.1007/S10107-013-0646-Z |
0.479 |
|
2014 |
Levi R, Magnanti T, Muckstadt J, Segev D, Zarybnisky E. Maintenance scheduling for modular systems: Modeling and algorithms Naval Research Logistics. 61: 472-488. DOI: 10.1002/Nav.21597 |
0.465 |
|
2014 |
Shi C, Zhang H, Chao X, Levi R. Approximation algorithms for capacitated stochastic inventory systems with setup costs Naval Research Logistics. 61: 304-319. DOI: 10.1002/Nav.21584 |
0.447 |
|
2013 |
Buchbinder N, Kimbrel T, Levi R, Makarychev K, Sviridenko M. Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms Operations Research. 61: 1014-1029. DOI: 10.1287/Opre.2013.1188 |
0.489 |
|
2013 |
Levi R, Shi C. Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times Operations Research. 61: 593-602. DOI: 10.1287/Opre.2013.1162 |
0.512 |
|
2013 |
Levi R, Yedidsion L. NP-hardness proof for the assembly problem with stationary setup and additive holding costs Operations Research Letters. 41: 134-137. DOI: 10.1016/J.Orl.2012.12.004 |
0.435 |
|
2012 |
Begen MA, Levi R, Queyranne M. Technical Note---A Sampling-Based Approach to Appointment Scheduling Operations Research. 60: 675-681. DOI: 10.1287/Opre.1120.1053 |
0.433 |
|
2012 |
Levi R, Shmoys DB, Swamy C. LP-based approximation algorithms for capacitated facility location Mathematical Programming. 131: 365-379. DOI: 10.1007/S10107-010-0380-8 |
0.725 |
|
2011 |
Huh WT, Levi R, Rusmevichientong P, Orlin JB. Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator Operations Research. 59: 929-941. DOI: 10.1287/Opre.1100.0906 |
0.414 |
|
2011 |
Geunes J, Levi R, Romeijn HE, Shmoys DB. Approximation algorithms for supply chain planning and logistics problems with market choice Mathematical Programming. 130: 85-106. DOI: 10.1007/S10107-009-0310-9 |
0.658 |
|
2010 |
Levi R, Radovanović A. Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources Operations Research. 58: 503-507. DOI: 10.1287/Opre.1090.0714 |
0.402 |
|
2009 |
Schoenmeyr T, Dunn PF, Gamarnik D, Levi R, Berger DL, Daily BJ, Levine WC, Sandberg WS. A model for understanding the impacts of demand and capacity on waiting time to enter a congested recovery room. Anesthesiology. 110: 1293-304. PMID 19417595 DOI: 10.1097/Aln.0B013E3181A16983 |
0.301 |
|
2008 |
Levi R, Roundy RO, Shmoys DB, Van Truong A. Approximation algorithms for capacitated stochastic inventory control models Operations Research. 56: 1184-1199. DOI: 10.1287/Opre.1080.0580 |
0.665 |
|
2008 |
Levi R, Lodi A, Sviridenko M. Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities Mathematics of Operations Research. 33: 461-474. DOI: 10.1287/Moor.1070.0305 |
0.508 |
|
2008 |
Levi R, Janakiraman G, Nagarajan M. A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales Mathematics of Operations Research. 33: 351-374. DOI: 10.1287/Moor.1070.0285 |
0.463 |
|
2008 |
Even G, Levi R, Rawitz D, Schieber B, Shahar S(, Sviridenko M. Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs Acm Transactions On Algorithms. 4: 34. DOI: 10.1145/1367064.1367074 |
0.422 |
|
2007 |
Levi R, Roundy RO, Shmoys DB. Provably near-optimal sampling-based policies for stochastic inventory control models Mathematics of Operations Research. 32: 821-839. DOI: 10.1287/Moor.1070.0272 |
0.653 |
|
2006 |
Levi R, Roundy RO, Shmoys DB. Provably near-optimal sampling-based algorithms for stochastic Inventory control models Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 739-748. |
0.626 |
|
2006 |
Levi R, Sviridenko M. Improved approximation algorithm for the one-warehouse multi-retailer problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4110: 188-199. |
0.348 |
|
2005 |
Levi R, Pál M, Roundy RO, Shmoys DB, Subramanian R, Hu X, Allon G, Caro F, Lutze HS. The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners Manufacturing & Service Operations Management. 7: 81-99. DOI: 10.1287/Msom.1050.0075 |
0.54 |
|
2005 |
Levi R, Pál M, Roundy R, Shmoys DB. Approximation algorithms for stochastic inventory control models Lecture Notes in Computer Science. 3509: 306-320. DOI: 10.1287/Moor.1060.0205 |
0.713 |
|
2005 |
Levi R, Roundy R, Shmoys DB. A constant approximation algorithm for the one-warehouse multi-retailer problem Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 365-374. DOI: 10.1287/Mnsc.1070.0781 |
0.686 |
|
2005 |
Levi R, Geunes J, Romeijn HE, Shmoys DB. Inventory and facility location models with market selection Lecture Notes in Computer Science. 3509: 111-124. |
0.607 |
|
2004 |
Levi R, Roundy R, Shmoys DB. Primal-dual algorithms for deterministic inventory problems Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 353-362. DOI: 10.1287/Moor.1050.0178 |
0.69 |
|
Show low-probability matches. |