The DOI matches its Crossref record.
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
Open accessAbstract
The network-flow problem, originally posed by T. Harris of the Rand Corporation, has been discussed from various viewpoints in (1; 2; 7; 16). The problem arises naturally in the study of transportation networks; it may be stated in the following way. One is given a network of directed arcs and nodes with two distinguished nodes, called source and sink, respectively. All other nodes are called intermediate. Each directed arc in the network has associated with it a nonnegative integer, its flow capacity. Source arcs may be assumed to be directed away from the source, sink arcs into the sink. Subject to the conditions that the flow in an arc is in the direction of the arc and does not exceed its capacity, and that the total flow into any intermediate node is equal to the flow out of it, it is desired to find a maximal flow from source to sink in the network, i.e., a flow which maximizes the sum of the flows in source (or sink) arcs. Thus, if we let P1 be the source, Pn the sink, we are required to find xij (i,j =1, . . . , w) which maximize
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
Cited by
Learning Hierarchical Features for Scene Labeling
Farabet, C., Couprie, C., Najman, L., & LeCun, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.231 · Cited by 2,620
Variants of the hungarian method for assignment problems
Kuhn, H. W. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030404 · Cited by 386
A network analysis of inka roads, administrative centers, and storage facilities
Jenkins, D. (2001) · Ethnohistory · doi:10.1215/00141801-48-4-655 · Cited by 60
Metadata
- Authors
- Ford, L. R., & Fulkerson, D. R.
- Venue
- Canadian Journal of Mathematics
- Publisher
- Canadian Mathematical Society
- Published
- 1957
- Volume
- 9
- Pages
- 210-218
- ISSN
- 0008-414X (ISSN-L)
- 1496-4279
- OpenAlex
- W2044437461
- Cited by
- 286
- References
- 0
- FWCI
- 18.37
- Type
- journal article
- Language
- en
- Open access
- bronze
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 Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem. https://app.cochat.ai/papers/10.4153/cjm-1957-024-0
- The paper
- Ford, L. R., & Fulkerson, D. R. (1957). A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem. Canadian Journal of Mathematics. https://doi.org/10.4153/cjm-1957-024-0
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.
