The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the average number of steps of the simplex method of linear programming
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
An Introduction to Probability Theory and Its Applications
Feller, W., & Morse, P. M. (1958) · Physics Today · doi:10.1063/1.3062516 · Cited by 2,040
Activity Analysis of Production and Allocation.
Carter, C. F., & Koopmans, T. C. (1952) · The Economic Journal · doi:10.2307/2226909 · Cited by 1,934
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
Complementary pivot theory of mathematical programming
Cottle, R. W., & Dantzig, G. B. (1968) · Linear Algebra and its Applications · doi:10.1016/0024-3795(68)90052-9 · Cited by 767
An Introduction to Probability Theory and its Applications.
David, F. N., & Feller, W. (1958) · Biometrika · doi:10.2307/2333079 · Cited by 465
The Gauss-Bonnet theorem for Riemannian polyhedra
Allendoerfer, C. B., & Weil, A. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007627-9 · Cited by 200
Linear programming and theory of games
Gupta, P. K. (1979) · Medical Entomology and Zoology · Cited by 165
A new linear programming algorithm — better or worse than the Simplex Method?
Lovász, L. (1980) · The Mathematical Intelligencer · doi:10.1007/bf03023055 · Cited by 24
Cited by
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Smale, S.
- Venue
- Mathematical Programming
- Published
- 1983-10
- Volume
- 27
- Issue
- 3
- Pages
- 241-262
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2002273082
- Cited by
- 279
- References
- 11
- FWCI
- 14.58
- 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
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.