نتایج جستجو برای: network flow problem

تعداد نتایج: 1873348  

Journal: :European Journal of Operational Research 2011
Ibrahim Akgün Barbaros Ç. Tansel R. Kevin Wood

This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K P 3 pre-specified node groups while an interdictor uses limited resources to interdict network arcs to minimize this maximum flow. The paper proposes an exact (MTNIP-E) and an approximating model (MPNIM) to solve this NP-hard ...

Journal: :journal of artificial intelligence in electrical engineering 0

transmission network expansion planning (tnep) is an important component of power system planning. itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. different methods have been proposed for the solution of the static transmissionnetwork expansion planning (stnep) problem till now. but in all of them, stnep pr...

Transportation problems are usually considered in large-scale networks, where finding the optimal solution of these problems is so time-consuming and costly. Therefore, a useful method to solve the large-scale network problems is dividing them into some smaller sub-problems. In this paper, for the first time, the origin-destination (o-d) matrix estimation problem is considered through a mixed p...

Journal: :Algorithmic Operations Research 2012
A. L. N. Murthy G. S. R. Murthy

Irrigation water management plays a crucial role in the growth and prosperity of countries like India. Optimization Techniques can be effectively used in the management of irrigation water. Motivated by a real crisis in Andhra Pradesh, India, the authors made an attempt to provide scientific solution to the problem of management of Pennar Delta System of Nellore District in Andhra Pradesh. The ...

Journal: :European Journal of Operational Research 2009
Patrice Marcotte Gilles Savard Daoli Zhu

This paper is concerned with the characterization of optimal strategies for a service firm acting in an oligopolistic environment. The decision problem is formulated as a leader-follower game played on a transportation network, where the leader firm selects a revenue-maximizing price schedule that takes explicitly into account the rational behavior of the customers. In the context of our analys...

2013
Ibrahim Khider Khalid

Network coding has been shown to be an effective way to achieve the maximum flow capacity of network. In this paper the study performance of network coding using different types of MAC leads to gathering different results and comparing them with respect to performance. The results revealed malfunctioning current of realistic MAC layer .The study showed that this methodology might be the promisi...

Journal: :journal of water sciences research 2012
a.r mardookhpour

in order to determine hydrological behavior and water management of sepidroud river (north of iran-guilan) the present study has focused on stream flow prediction by using artificial neural network. ten years observed inflow data (2000-2009) of sepidroud river were selected; then these data have been forecasted by using neural network. finally, predicted results are compared to the observed dat...

2016
Andreas Veit Michael J. Wilber Serge J. Belongie

In this work we propose a novel interpretation of residual networks showing that they can be seen as a collection of many paths of differing length. Moreover, residual networks seem to enable very deep networks by leveraging only the short paths during training. To support this observation, we rewrite residual networks as an explicit collection of paths. Unlike traditional models, paths through...

Journal: :JASIST 2014
Erjia Yan

This paper discovers patterns of knowledge dissemination among scientific disciplines. While the transfer of knowledge is largely unobservable, citations from one discipline to another have been proven to be an effective proxy to study disciplinary knowledge flow. This study constructs a knowledge flow network in that a node represents a Journal Citation Report subject category and a link denot...

2006
A. Engau H. W. Hamacher Alexander Engau Horst W. Hamacher

Linear and integer programs are considered whose coefficient matrices can be partitioned into K consecutive ones matrices. Mimicking the special case of K = 1 which is well-known to be equivalent to a network flow problem we show that these programs can be transformed to a generalized network flow problem which we call semi-simultaneous (se-sim) network flow problem. Feasibility conditions for ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید