The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Complexity of Optimal Queuing Network Control
Abstract
We show that several well-known optimization problems related to the optimal control of queues are provably intractable—independently of any unproven conjecture such as P ≠ NP. In particular, we show that several versions of the problem of optimally controlling a simple network of queues with simple arrival and service distributions and multiple customer classes is complete for exponential time. This is perhaps the first such intractability result for a well-known optimization problem. We also show that the restless bandit problem (the generalization of the multi-armed bandit problem to the case in which the unselected processes are not quiescent) is complete for polynomial space.
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
Cites
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Fischer, M. J., & Rabin, M. O. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_5 · Cited by 331
Cited by
Why Copy Others? Insights from the Social Learning Strategies Tournament
Rendell, L., Boyd, R., Cownden, D., Enquist, M., Eriksson, K., Feldman, M. W., Fogarty, L., Ghirlanda, S., Lillicrap, T., & Laland, K. N. (2010) · Science · doi:10.1126/science.1184719 · Cited by 811
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Metadata
- Authors
- Papadimitriou, C. H., & Tsitsiklis, J. N.
- Venue
- Mathematics of Operations Research
- Published
- 1999-05
- Volume
- 24
- Issue
- 2
- Pages
- 293-305
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2105556121
- Cited by
- 469
- References
- 1
- FWCI
- 11.92
- 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 Complexity of Optimal Queuing Network Control. https://app.cochat.ai/papers/10.1287/moor.24.2.293
- The paper
- Papadimitriou, C. H., & Tsitsiklis, J. N. (1999). The Complexity of Optimal Queuing Network Control. Mathematics of Operations Research. https://doi.org/10.1287/moor.24.2.293
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.
