Joint Placement, Delivery Promise, and Fulfillment in Online Retail

References

• Acimovic J, Graves SC (2015) Making better fulfillment decisions on the fly in an online retail environment. Manufacturing Service Oper. Management 17(1):34–51.Link, Google Scholar
• Ageev AA, Sviridenko M (2004) Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Combin. Optim. 8:307–328.Crossref, Google Scholar
• Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2):930–972.Crossref, Google Scholar
• Amil A, Makhdoumi A, Wei Y (2022) Multi-item order fulfillment revisited: LP formulation and prophet inequality. Preprint, submitted August 4, https://dx.doi.org/10.2139/ssrn.4176274.Google Scholar
• Andrews JM, Farias V, Khojandi AI, Yan CM (2019) Primal–dual algorithms for order fulfillment at Urban Outfitters, Inc. INFORMS J. Appl. Anal. 49(5):355–370.Link, Google Scholar
• Aouad A, Saritac O (2022) Dynamic stochastic matching under limited time. Oper. Res. 70(4):2349–2383.Link, Google Scholar
• Baek J, Ma W (2022) Technical note—Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources. Oper. Res. 70(4):2226–2236.Link, Google Scholar
• Bai Y, El Housni O, Rusmevichientong P, Topaloglu H (2022) Coordinated inventory stocking and assortment personalization. Technical report, Cornell University, Ithaca, NY.Google Scholar
• Bertsekas DP, Tsitsiklis JN (1996) Neuro-Dynamic Programming (Athena Scientific, Belmont, MA). Google Scholar
• Brown DB, Zhang J (2023) Technical note—On the strength of relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 71(6):2374–2389.Link, Google Scholar
• Cao S, He S (2019) Discrete convex optimization and applications in supply chain management. Du DZ, Pardalos PM, Zhang Z, eds. Nonlinear Combinatorial Optimization (Springer, Cham, Switzerland), 81–121.Crossref, Google Scholar
• Chen AI, Graves SC (2021) Item aggregation and column generation for online-retail inventory placement. Manufacturing Service Oper. Management 23(5):1062–1076.Link, Google Scholar
• Chen QG, Lei YM, Jasin S (2023) Real-time spatial-intertemporal pricing and relocation in a ride-hailing network: Near-optimal policies and the value of dynamic pricing. Oper. Res. 72(5):2097–2118.Link, Google Scholar
• Chen X, Feldman J, Jung SH, Kouvelis P (2022) Approximation schemes for the joint inventory selection and online resource allocation problem. Production Oper. Management 31(8):3143–3159.Crossref, Google Scholar
• Cheung RK, Powell WB (1996) An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. 44(6):951–963.Link, Google Scholar
• Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720–727.Link, Google Scholar
• DeValve L, Pekec S, Wei Y (2022) Approximate submodularity in network design problems. Oper. Res. 71(4):1021–1039.Link, Google Scholar
• DeValve L, Wei Y, Wu D, Yuan R (2023) Understanding the value of fulfillment flexibility in an online retailing environment. Manufacturing Service Oper. Management 25(2):391–408.Link, Google Scholar
• El Housni O, Topaloglu H (2023) Joint assortment optimization and customization under a mixture of multinomial logit models: On the value of personalized assortments. Oper. Res. 71(4):1197–1215.Link, Google Scholar
• Ene A, Nguyen HL (2018) A reduction for optimizing lattice submodular functions with diminishing returns. Technical report, University of Warwick, Coventry, UK.Google Scholar
• Feldman M (2013) Maximization problems with submodular objective functions. Unpublished PhD thesis, Technion Israel Institute of Technology, Haifa, Israel.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2020) Near-optimal Bayesian online assortment of reusable resources. Technical report, University of Chicago, IL.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2023) Two-stage stochastic matching and pricing with applications to ride hailing. Oper. Res. 72(4):1574–1594.Link, Google Scholar
• Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Computational Optimization Research Center Technical Report TR-2004-01, Columbia University, New York.Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2015) Online resource allocation with customer choice. Technical report, Columbia University, New York.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Jasin S, Sinha A (2015) An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment. Oper. Res. 63(6):1336–1351.Link, Google Scholar
• Jiang J, Ma W, Zhang J (2023) Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack. Preprint, submitted July 5, 2021, https://arxiv.org/abs/2107.02058.Google Scholar
• Kaggle (2021) Brazilian e-commerce public dataset by Olist. Accessed February 28, 2025, https://www.kaggle.com/datasets/olistbr/brazilian-ecommerce.Google Scholar
• Kunnumkal S, Talluri K (2016) On a piecewise-linear approximation for network revenue management. Math. Oper. Res. 41(1):72–91.Link, Google Scholar
• Lee J, Mirrokni VS, Nagarajan V, Sviridenko M (2010) Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J. Discrete Math. 23(4):2053–2078.Crossref, Google Scholar
• Lei YM, Jasin S, Uichanco J, Vakhutinsky A (2022b) Joint product framing (display, ranking, pricing) and order fulfillment under the multinomial logit model for e-commerce retailers. Manufacturing Service Oper. Management 24(3):1529–1546.Link, Google Scholar
• Lei M, Liu S, Jasin S, Vakhutinsky A (2022a) Joint inventory and pricing for a one-warehouse multistore problem: Spiraling phenomena, near optimal policies, and the value of dynamic pricing. Oper. Res. 72(2):738–762.Link, Google Scholar
• Lim YF, Jiu S, Ang M (2021) Integrating anticipative replenishment allocation with reactive fulfillment for online retailing using robust optimization. Manufacturing Service Oper. Management 23(6):1616–1633.Link, Google Scholar
• Liu Q, van Ryzin G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• Ma Y, Rusmevichientong P, Sumida M, Topaloglu H (2020) An approximation algorithm for network revenue management under nonstationary arrivals. Oper. Res. 68(3):834–855.Link, Google Scholar
• Manshadi V, Rodilitz S (2022) Online policies for efficient volunteer crowdsourcing. Management Sci. 68(9):6572–6590.Link, Google Scholar
• Nemhauser G, Wolsey L, Fisher M (1978) An analysis of approximations for maximizing submodular set functions—I. Math. Programming 14:265–294.Crossref, Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H, Bai Y (2023) Revenue management with heterogeneous resources: Unit resource capacities, advance bookings, and itineraries over time intervals. Oper. Res. 71(6):2196–2216.Link, Google Scholar
• Shapley LS (1962) Complements and substitutes in the optimal assignment problem. Naval Res. Logist. Quart. 9(1):45–48.Crossref, Google Scholar
• Stein C, Truong V-A, Wang X (2020) Advance service reservations with heterogeneous customers. Management Sci. 66(7):2929–2950.Link, Google Scholar
• Talluri K, van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.Link, Google Scholar
• Talluri K, van Ryzin G (1999) A randomized linear programming method for computing network bid prices. Transportation Sci. 33(2):207–216.Link, Google Scholar
• Wang X, Truong V-A, Bank D (2016) Online advance admission scheduling for services, with customer preferences. Technical report, Columbia University, New York.Google Scholar
• Wei L, Kapuscinski R, Jasin S (2021) Shipping consolidation across two warehouses with delivery deadline and expedited options for e-commerce and omni-channel retailers. Manufacturing Service Oper. Management 23(6):1634–1650.Link, Google Scholar