Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 194

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Dynamic Programming Approximations for a Stochastic Inventory Routing Problem

Kleywegt, Anton J., Nori, Vijay S., Savelsbergh, Martin W. P.·2004·Transportation Science

Abstract

This work is motivated by the need to solve the inventory routing problem when implementing a business practice called vendor managed inventory replenishment (VMI). With VMI, vendors monitor their customers′ inventories and decide when and how much inventory should be replenished at each customer. The inventory routing problem attempts to coordinate inventory replenishment and transportation in such a way that the cost is minimized over the long run. We formulate a Markov decision process model of the stochastic inventory routing problem and propose approximation methods to find good solutions with reasonable computational effort. We indicate how the proposed approach can be used for other Markov decision processes involving the control of multiple resources.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/trsc.1030.0041

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 194

Metadata

Authors
Kleywegt, A. J., Nori, V. S., & Savelsbergh, M. W. P.
Venue
Transportation Science
Published
2004-02
Volume
38
Issue
1
Pages
42-70
ISSN
  • 0041-1655 (ISSN-L)
  • 1526-5447
OpenAlex
W2150838944
Cited by
194
References
2
FWCI
38.48
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Dynamic Programming Approximations for a Stochastic Inventory Routing Problem. https://app.cochat.ai/papers/10.1287/trsc.1030.0041
The paper
Kleywegt, A. J., Nori, V. S., & Savelsbergh, M. W. P. (2004). Dynamic Programming Approximations for a Stochastic Inventory Routing Problem. Transportation Science. https://doi.org/10.1287/trsc.1030.0041

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.