Journal article · 2026 · Open access
Optimizing Inventory Placement for a Downstream Online Matching Problem
Manufacturing & Service Operations Management · Published 14 August 2026 · DOI 10.1287/msom.2025.0199
In brief
“Optimizing Inventory Placement for a Downstream Online Matching Problem” is a 2026 journal article by Boris Epstein and Will Ma, published in Manufacturing & Service Operations Management. OpenAlex counts 13 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 13
- Most cited in
- 2026 (8)
- Field-weighted impact
- 19.40
- References
- 32
- Authors
- 2
Abstract
Problem definition: We study the inventory placement problem of splitting [Formula: see text] units of a single item across warehouses in advance of a downstream online matching problem that represents the dynamic fulfillment decisions of an e-commerce retailer. This is a challenging problem both theoretically, due to the computational complexity of the downstream matching problem, and practically, as the fulfillment team continuously updates its algorithm while the placement team lacks direct evaluation of placement decisions. Methodology/results: We compare the performance of three placement procedures based on optimizing surrogate functions that have been studied and applied: Offline, Myopic, and Fluid placement. On the theory side, we show that optimizing inventory placement for the Offline surrogate leads to an [Formula: see text]-approximation for the joint placement and fulfillment problem under any demand model that admits an [Formula: see text]-competitive fulfillment policy. We assume [Formula: see text] is an upper bound on how many warehouses can serve any demand location. The crux of our theoretical contribution is to use randomized rounding to derive a tight [Formula: see text]-approximation for the integer programming problem of optimizing the Offline surrogate. We further show how to extend this result to a multi-SKU setting, improving upon the best known approximation of [Formula: see text]. We use statistical learning to show that rounding after optimizing a sample-average Offline surrogate, which is necessary due to the exponentially-sized support, indeed has vanishing loss. On the experimental side, we evaluate how different combinations of placement and fulfillment procedures perform on a wide array of synthetic instances. When coupled with a good fulfillment procedure, optimizing the Offline surrogate performs best even compared to computationally-intensive simulation procedures, corroborating our theory. Managerial implications: Theoretical guarantees and extensive numerics both suggest that the placement team should optimize the (optimistic) Offline surrogate, assuming the fulfillment team has a good algorithm. Otherwise, the placement team could optimize the (pessimistic) Myopic surrogate instead.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Epstein, B., & Ma, W. (2026). Optimizing Inventory Placement for a Downstream Online Matching Problem. Manufacturing & Service Operations Management. https://doi.org/10.1287/msom.2025.0199
MLA 9
Epstein, Boris, and Will Ma. “Optimizing Inventory Placement for a Downstream Online Matching Problem.” Manufacturing & Service Operations Management, 2026. https://doi.org/10.1287/msom.2025.0199.
Chicago
Epstein, Boris and Will Ma. 2026. “Optimizing Inventory Placement for a Downstream Online Matching Problem.” Manufacturing & Service Operations Management. https://doi.org/10.1287/msom.2025.0199.
Harvard
Epstein, B. and Ma, W. (2026) ‘Optimizing Inventory Placement for a Downstream Online Matching Problem’, Manufacturing & Service Operations Management. doi:10.1287/msom.2025.0199.
IEEE
B. Epstein and W. Ma, “Optimizing Inventory Placement for a Downstream Online Matching Problem,” Manufacturing & Service Operations Management, 2026, doi: 10.1287/msom.2025.0199.
BibTeX
@article{epstein2026optimizing,
title = {{Optimizing Inventory Placement for a Downstream Online Matching Problem}},
author = {Epstein, Boris and Ma, Will},
journal = {Manufacturing \& Service Operations Management},
year = {2026},
doi = {10.1287/msom.2025.0199},
url = {https://doi.org/10.1287/msom.2025.0199}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2022 | 2 | |
| 2024 | 1 | |
| 2025 | 2 | |
| 2026 | 8 |
Its field-weighted citation impact is 19.40: it has been cited 19.40 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Supply Chain and Inventory Management
- warehouse location
- online matching
- e-commerce fulfillment
- approximation algorithms
- randomized rounding
- surrogate-based optimization
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Epstein, B., & Ma, W. (2026). Optimizing Inventory Placement for a Downstream Online Matching Problem. Manufacturing & Service Operations Management. https://doi.org/10.1287/msom.2025.0199
How many times has this paper been cited?
13 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Boris Epstein, Will Ma.
What is the DOI of this paper?
10.1287/msom.2025.0199, permanently at https://doi.org/10.1287/msom.2025.0199. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.