The DOI matches its Crossref record.
The Dynamic and Stochastic Knapsack Problem
Abstract
The Dynamic and Stochastic Knapsack Problem (DSKP) is defined as follows. Items arrive according to a Poisson process in time. Each item has a demand (size) for a limited resource (the knapsack) and an associated reward. The resource requirements and rewards are jointly distributed according to a known probability distribution and become known at the time of the item's arrival. Items can be either accepted or rejected. If an item is accepted, the item's reward is received; and if an item is rejected, a penalty is paid. The problem can be stopped at any time, at which time a terminal value is received, which may depend on the amount of resource remaining. Given the waiting cost and the time horizon of the problem, the objective is to determine the optimal policy that maximizes the expected value (rewards minus costs) accumulated. Assuming that all items have equal sizes but random rewards, optimal solutions are derived for a variety of cost structures and time horizons, and recursive algorithms for computing them are developed. Optimal closed-form solutions are obtained for special cases. The DSKP has applications in freight transportation, in scheduling of batch processors, in selling of assets, and in selection of investment projects.
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Revenue Management: Research Overview and Prospects
McGill, J. I., & van Ryzin, G. J. (1999) · Transportation Science · doi:10.1287/trsc.33.2.233 · Cited by 1,131
Revenue Management Under a General Discrete Choice Model of Consumer Behavior
Talluri, K., & van Ryzin, G. (2004) · Management Science · doi:10.1287/mnsc.1030.0147 · Cited by 1,108
An overview of revenue management and dynamic pricing models in hotel business
Bandalouski, A. M., Kovalyov, M. Y., Pesch, E., & Tarim, S. A. (2018) · RAIRO - Operations Research · doi:10.1051/ro/2018001 · Cited by 25
Metadata
- Authors
- Kleywegt, A. J., & Papastavrou, J. D.
- Venue
- Operations Research
- Published
- 1998-02
- Volume
- 46
- Issue
- 1
- Pages
- 17-35
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2148849245
- Cited by
- 215
- References
- 0
- FWCI
- 19.25
- 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: The Dynamic and Stochastic Knapsack Problem. https://app.cochat.ai/papers/10.1287/opre.46.1.17
- The paper
- Kleywegt, A. J., & Papastavrou, J. D. (1998). The Dynamic and Stochastic Knapsack Problem. Operations Research. https://doi.org/10.1287/opre.46.1.17
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.