A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We consider a network revenue management problem with customer choice and exogenous prices. We study the performance of a class of certainty-equivalent heuristic control policies. These heuristics periodically re-solve the deterministic linear program (DLP) that results when all future random variables are replaced by their average values and implement the solutions in a probabilistic manner. We provide an upper bound for the expected revenue loss under such policies when compared to the optimal policy. Using this bound, we construct a schedule of re-solving times such that the resulting expected revenue loss, obtained by re-solving the DLP at these times and implementing the solution as a probabilistic scheme, is bounded by a constant that is independent of the size of the problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Theory and Practice of Revenue Management
Talluri, K. T., & Van Ryzin, G. J. (2004) · International Series in Operations Research & Management Science · doi:10.1007/b139000 · Cited by 2,243
Cited by
Clearance Pricing Optimization for a Fast-Fashion Retailer
Caro, F., & Gallien, J. (2012) · Operations Research · doi:10.1287/opre.1120.1102 · Cited by 203
Clearance Pricing Optimization for a Fast-Fashion Retailer
Caro, F., & Gallien, J. (2010) · SSRN Electronic Journal · doi:10.2139/ssrn.1731402 · Cited by 203
Metadata
- Authors
- Jasin, S., & Kumar, S.
- Venue
- Mathematics of Operations Research
- Published
- 2012-05
- Volume
- 37
- Issue
- 2
- Pages
- 313-345
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W1986352749
- Cited by
- 172
- References
- 1
- FWCI
- 16.64
- 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: A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice. https://app.cochat.ai/papers/10.1287/moor.1120.0537
- The paper
- Jasin, S., & Kumar, S. (2012). A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice. Mathematics of Operations Research. https://doi.org/10.1287/moor.1120.0537
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.