The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Discrete-Variable Extremum Problems
Abstract
This paper reviews some recent successes in the use of linear programming methods for the solution of discrete-variable extremum problems. One example of the use of the multistage approach of dynamic programming for this purpose is also discussed.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Optimal two‐ and three‐stage production schedules with setup times included
Johnson, S. M. (1954) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800010110 · Cited by 3,252
The theory of dynamic programming
Bellman, R. (1954) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1954-09848-8 · Cited by 1,459
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
Self-citationSome Problems in the Theory of Dynamic Programming
Bellman, R. (1954) · Econometrica · doi:10.2307/1909830 · Cited by 171
Dynamic programming and a new formalism in the calculus of variations
Bellman, R. (1954) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.40.4.231 · Cited by 123
Bottleneck Problems and Dynamic Programming
Bellman, R. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.9.947 · Cited by 119
Some Applications of the Theory of Dynamic Programming—A Review
Bellman, R. (1954) · Journal of the Operations Research Society of America · doi:10.1287/opre.2.3.275 · Cited by 89
On some variational problems occurring in the theory of dynamic programming
Bellman, R., Glicksberg, I., & Gross, O. (1954) · Rendiconti del Circolo Matematico di Palermo Series 2 · doi:10.1007/bf02849266 · Cited by 28
Cited by
A Linear Programming Approach to the Cutting-Stock Problem
Gilmore, P. C., & Gomory, R. E. (1961) · Operations Research · doi:10.1287/opre.9.6.849 · Cited by 2,024
A Linear Programming Approach to the Cutting Stock Problem—Part II
Gilmore, P. C., & Gomory, R. E. (1963) · Operations Research · doi:10.1287/opre.11.6.863 · Cited by 1,119
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
Analyzing vision at the complexity level
Tsotsos, J. K. (1990) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00079577 · Cited by 707
Mixed Integer Linear Programming Formulation Techniques
Vielma, J. P. (2015) · SIAM Review · doi:10.1137/130915303 · Cited by 358
Metadata
- Authors
- Dantzig, G. B.
- Venue
- Operations Research
- Published
- 1957-04
- Volume
- 5
- Issue
- 2
- Pages
- 266-288
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2060322444
- Cited by
- 910
- References
- 9
- FWCI
- 33.13
- 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: Discrete-Variable Extremum Problems. https://app.cochat.ai/papers/10.1287/opre.5.2.266
- The paper
- Dantzig, G. B. (1957). Discrete-Variable Extremum Problems. Operations Research. https://doi.org/10.1287/opre.5.2.266
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.