Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
In this study teleconnections between monthly northern hemisphere lower stratospheric geopotential heights (100, 50, 30 hPa) and… 
2010
2010
This paper proposes a strategy of urban bimodal traffic regulation based on multi-agent modelization. The objective of this… 
2007
2007
The idea is that given a 22-optimal circulation f with respect to potentials p, the subroutine will find an 2-optimal circulation… 
2005
2005
The most efficient algorithms for several network problems like minimum cost flow and the maximum weight matching problem follow… 
1985
1985
The overall methodology developed in this paper can be organized into two major parts. The first part consists of a… 
1983
1983
The flow circulation sharing problem is defined as a network flow circulation problem with a maximin objective function. The arcs… 
1974
1974
Arterial thrombosis have been demonstrated by aortography after umbilical arterial catheter removal in infants having required…