Abstract: This paper proposes an algorithm to solve multi - intersection coordinated control problem, which combines the maximal flow theory with the game theory and considers both the individual ...

Abstract: Objective: Novel applications of transcranial Doppler (TCD) ultrasonography, such as the assessment of cerebral vessel narrowing/occlusion or the non-invasive estimation of intracranial ...

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

This is a preview. Log in through your library . Abstract A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset. If each node has an assigned weight, which ...

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...

A team of researchers led by Rasmus Kinn of the Swiss Federal Institute of Technology in Zurich has created a near-perfect algorithm to calculate the maximum transport flows at the lowest cost in any ...