Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,014,503 papers from all fields of science
Search
Sign In
Create Free Account
Circulation problem
Known as:
Circulation
, Minimum cost circulation problem
, Network circulation
The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Flow network
Fulkerson Prize
Linear programming
Maximum flow problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
Relationship between lower stratospheric circulation and Indian summer monsoon rainfall : Implication for long range forecasts
Akshay Rohilla
,
D. Pai
,
M. Rajeevan
Mausam
2021
Corpus ID: 134225413
In this study teleconnections between monthly northern hemisphere lower stratospheric geopotential heights (100, 50, 30 hPa) and…
Expand
2010
2010
A multi-agent system to regulate urban traffic: Private vehicles and public transport
N. Bhouri
,
Sofiane Haciane
,
Flavien Balbo
13th International IEEE Conference on Intelligent…
2010
Corpus ID: 8664345
This paper proposes a strategy of urban bimodal traffic regulation based on multi-agent modelization. The objective of this…
Expand
2007
2007
Orie 633 Network Flows 1 Algorithms for Minimum-cost Circulations 1.1 a Cost-scaling Algorithm
David P. Williamson
,
A. Mitra
2007
Corpus ID: 48251130
The idea is that given a 22-optimal circulation f with respect to potentials p, the subroutine will find an 2-optimal circulation…
Expand
2005
2005
Network Problems with Non-Polynomial Weights And Applications
K. Mehlhorn
,
D. Michail
2005
Corpus ID: 8101771
The most efficient algorithms for several network problems like minimum cost flow and the maximum weight matching problem follow…
Expand
2005
2005
Optimizing ad hoc trade in a commercial barter trade exchange
P. Haddawy
,
Christine T. Cheng
,
Namthip Rujikeadkumjorn
,
Khaimook Dhananaiyapergse
Electronic Commerce Research and Applications
2005
Corpus ID: 5697474
1997
1997
On Lower Bounds for Numbered Complete Graphs
P. Hansen
,
B. Jaumard
,
Christophe Meyer
Discrete Applied Mathematics
1997
Corpus ID: 34487607
1985
1985
A heuristic circulation-network approach to solve the multi-traveling salesman problem
A. Garcia-Diaz
Networks
1985
Corpus ID: 37540925
The overall methodology developed in this paper can be organized into two major parts. The first part consists of a…
Expand
1983
1983
The flow circulation sharing problem
J. R. Brown
Mathematical programming
1983
Corpus ID: 657349
The flow circulation sharing problem is defined as a network flow circulation problem with a maximin objective function. The arcs…
Expand
1982
1982
Minimization on submodular flows
Uwe Zimmermann
Discrete Applied Mathematics
1982
Corpus ID: 205053472
1974
1974
AN EVALUATION OF LOWER LIMB CIRCULATION IN INFANTS HAVING HAD INDWELLING UMBILICAL CATHETER DURING THE NEO-NATAL PERIOD
B. Betend
,
B. Doray
,
H. Bard
Pediatric Research
1974
Corpus ID: 6565658
Arterial thrombosis have been demonstrated by aortography after umbilical arterial catheter removal in infants having required…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE