نتایج جستجو برای: dynamic network simplex algorithm
تعداد نتایج: 1646976 فیلتر نتایج به سال:
The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex algorithm is one of the most efficient solution methods for MFP in practice. The theoretical properties of established pivot algorithms for MFP is less understood. Variants of the primal simplex and dual simplex methods for MFP have been proven strongly polynomial, but no similar result exists for ...
production of highly viscous tar sand bitumen using steam assisted gravity drainage (sagd) with a pair of horizontal wells has advantages over conventional steam flooding. this paper explores the use of artificial neural networks (anns) as an alternative to the traditional sagd simulation approach. feed forward, multi-layered neural network meta-models are trained through the back-error-propaga...
many efforts have been made to model the the hot deformation (dynamic recrystallization) flow curves of different materials. phenomenological constitutive models, physical-based constitutive models and artificial neural network (ann) models are the main methods used for this purpose. however, there is no report on the modeling of warm deformation (dynamic spheroidization) flow curves of any kin...
The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. For many applications of dynamic trees, values must be combined along paths. For other applications, values must be combin...
this paper presents a fault location technique for transmission lines with minimum current measurement. this algorithm investigates proper current ratios for fault location problem based on thevenin theory in faulty power networks and calculation of short circuit currents in each branch. these current ratios are extracted regarding lowest sensitivity on thevenin impedance variations of the netw...
random early detection (red) is one of the most commonly used active queue management (aqm) algorithms that is recommended by ietf for deployment in the network. although red provides low average queuing delay and high throughput at the same time, but effectiveness of red is highly sensitive to the red parameters setting. as network condition varies largely, setting red's parameters with fixed ...
Various methods have been used to economically design wastewater and stormwater collection systems. In this article, Discrete Differential Dynamic Programming (DDDP) which is a subsection of dynamic programming (DP) was used. For each pipe network, various alternatives such as depth and slope of pipe laying and various diameters could be considered to satisfy hydraulic and engineering constrain...
state estimation is the foundation of any control and decision making in power networks. the first requirement for a secure network is a precise and safe state estimator in order to make decisions based on accurate knowledge of the network status. this paper introduces a new estimator which is able to detect bad data with few calculations without need for repetitions and estimation residual cal...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید