Results 21 to 30 of about 1,124,505 (266)
INFLUENCE OF AIR TEMPERATURE AND PRECIPITATION ON THE MAXIMUM FLOW IN THE UPPER BASIN OF THE CRIŞUL NEGRU [PDF]
Analele Universităţii din Oradea: Seria Geografie, 2019 The present paper presents the influence of the main factors that generate the maximum flow in the upper basin of the Crisul Negru river. Starting from the three types of flow in the basin (maximum, average and minimum) and selecting among them the most ...
Dan-Mircea MIHALEA, Ovidiu BOTᾸU
doaj +1 more source
On multiroute maximum flows in networks [PDF]
Networks, 2001 AbstractLet G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij on each arc (i, j) ∈ A. An elementary K‐flow is a flow of K units from s to t such that the flow on each arcis 0 or 1. A K‐route flow is a flow from s to t that may be expressed as a nonnegative linear sum of elementary K ...
Charu C. Aggarwal, James B. Orlin
openaire +2 more sources
Present Environment and Sustainable Development, 2019 The present paper analyzes the extreme variabilities of rainfall and runoff regime within vulnerable hydrographic river basins, focused on a case study: Elan river basin, year 2016.
Tudorache Andreea-Violeta
doaj +1 more source
Stochastic Maximum Flow Network Interdiction with Endogenous Uncertainty [PDF]
International Journal of Supply and Operations Management, 2019 We describe the two-stage maximum flow network interdiction problem under endogenous stochastic interdiction. Our model consists of two agents playing a Stackelberg game.
Somayeh Sadeghi, Abbas Seifi
doaj +1 more source
Policy-Compliant Maximum Network Flows
Applied Sciences, 2019 Computer network administrators are often interested in the maximal bandwidth that can be achieved between two nodes in the network, or how many edges can fail before the network gets disconnected.
Pieter Audenaert +2 more
doaj +1 more source
Networks, 2020 AbstractIn 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan.
James B. Orlin, Xiao-Yue Gong
openaire +4 more sources
SOME ASPECTS REGARDING THE MAXIMUM FLOW THE COLD SEASON IN THE UPPER PART OF THE BUZĂU RIVER CATCHMENT [PDF]
Aerul şi Apa: Componente ale Mediului, 2013 This article aims to analyze the maximum flow during the cold season (November 1st to April 30th), in the upper part of the Buzău river Catchment. The research took into account only those floods whose maximum discharges exceeded twice the multiannual ...
GABRIEL MINEA, VIOREL CHENDEŞ
doaj
Hydrology, 2022 Global projections of climate change indicate negative impacts on hydrological systems, with significant changes in precipitation and temperature in many parts of the world. As a result, floods and droughts are expected.
Edwin Pino-Vargas +5 more
doaj +1 more source
On maximum flows in polyhedral domains [PDF]
Proceedings of the fourth annual symposium on Computational geometry - SCG '88, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Improved Maximum Flow Algorithm with Intersecting Vertices [PDF]
Jisuanji gongcheng, 2020 A hierarchical residual network constructed by the shortest augmented chain algorithm may lead to the loss of flow values when it faces multiple augmented chains with the same number of directed graphs and overlapped vertices,for it does not consider the
LUO Tiantian, ZHAO Lifeng
doaj +1 more source