The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
An algorithm for quadratic programming
Frank, M., & Wolfe, P. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030109 · Cited by 3,030
ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.
WARDROP, J. G. (1952) · Proceedings of the Institution of Civil Engineers · doi:10.1680/ipeds.1952.11259 · Cited by 2,205
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (2011) · Cited by 2,083
Studies in the Economics of Transportation.
R., D. J., Beckman, M., McGuire, C. B., Winsten, C. B., & Koopmans, T. (1956) · OR · doi:10.2307/3007560 · Cited by 1,613
Studies in the Economics of Transportation.
Smeed, R. J., Beckmann, M., McGuire, C. B., Winsten, C. B., & Koopmans, T. C. (1957) · The Economic Journal · doi:10.2307/2227641 · Cited by 1,488
Nonlinear programming: Theory and algorithms
Plastria, F. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90039-6 · Cited by 1,467
The Traffic Assignment Problem: Models and Methods
Patriksson, M. (1994) · Medical Entomology and Zoology · Cited by 1,047
A probabilistic multipath traffic assignment model which obviates path enumeration
Dial, R. B. (1971) · Transportation Research · doi:10.1016/0041-1647(71)90012-8 · Cited by 842
Self-citationA Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
Friesz, T. L., Bernstein, D. H., Smith, T. E., Tobin, R. L., & Wie, B. (1993) · Operations Research · doi:10.1287/opre.41.1.179 · Cited by 663
On the Goldstein-Levitin-Polyak gradient projection method
Bertsekas, D. P. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101194 · Cited by 583
Origin-Based Algorithm for the Traffic Assignment Problem
Bar–Gera, H. (2002) · Transportation Science · doi:10.1287/trsc.36.4.398.549 · Cited by 328
A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENTPreprint
Jayakrishnan, R., Tsai, W. T., Prashker, J. N., & Rajadhyaksha, S. (1994) · RePEc: Research Papers in Economics · Cited by 205
Delay/Volume Relations for Travel Forecasting Based upon the 1985 Highway Capacity Manual
Horowitz, A. J. (1991) · Cited by 43
Cited by
Route choice modeling: past, present and future research directions
Prato, C. G. (2009) · Journal of Choice Modelling · doi:10.1016/s1755-5345(13)70005-8 · Cited by 495
Gentile, G. (2016) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2016.02.005 · Cited by 45
Gentile, G. (2018) · Transportation Science · doi:10.1287/trsc.2018.0839 · Cited by 25
Metadata
- Authors
- Dial, R. B.
- Venue
- Transportation Research Part B: Methodological
- Publisher
- Elsevier BV
- Published
- 2006-12
- Volume
- 40
- Issue
- 10
- Pages
- 917-936
- ISSN
- 0191-2615 (ISSN-L)
- OpenAlex
- W2053806224
- Cited by
- 259
- References
- 16
- FWCI
- 15.85
- 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.