Circulation Problem is a network flow problem that seeks to find a feasible flow across a directed graph with demands and capacities on edges and nodes, distinguishing itself by requiring flow conservation at every node without designated sources or sinks.
53
Publications
3K
Citations
125
Authors
53
Institutions
Publications per year
2017–2026
7
Variants
Circulation Problem
Parents
Publications
53
A strongly polynomial minimum cost circulation algorithm
Éva Tardos · COMBINATORICA · 1985 · 378 citations
Tinsley R. Harrison · The American Journal of the Medical Sciences · 1935 · 187 citations
Medicine, Cardiology, Physiology +11
1–5 of 53
Authors
125
- AV
5
h-index
- RE
4
h-index
- ÉT
4
h-index
- DG
3
h-index
- ZJ
3
h-index
1–5 of 125
Institutions
53
Stanford University
Stanford, United States
5 h-index
6 publications
940 citations
Princeton University
Princeton, United States
4 h-index
4 publications
755 citations
Columbia University
New York, United States
3 h-index
4 publications
201 citations
Missouri University of Science and Technology
Rolla, United States
3 h-index
15 publications
303 citations
Halliburton (United Kingdom)
Arbroath, United Kingdom
3 h-index
9 publications
168 citations
Shell (Germany)
Hamburg, Germany
2 h-index
2 publications
27 citations
Saudi Aramco (United States)
Houston, United States
2 h-index
3 publications
63 citations
Shell (United Kingdom)
London, United Kingdom
2 h-index
4 publications
54 citations
1–8 of 53
Venues
- Mathematics of Operations Research
5 publications · 585 citations
5
h-index
- SPE Kingdom of Saudi Arabia Annual Technical Symposium and Exhibition
2 publications · 58 citations
2
h-index
- Mathematical Programming
2 publications · 91 citations
2
h-index
- PubMed
Repository · 2 publications · 30 citations
2
h-index
- Clinical Medicine
ClinMed · 2 publications · 80 citations
2
h-index
1–5