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

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

2001
Y. Thomas Hou Yi Shi Jianping Pan Scott F. Midkiff

Wireless sensor networks are becoming increasingly important in recent years due to their ability to detect and convey real-time in-situ scenes for many civil and military applications. A major technical challenge for a wireless sensor network lies in the energy constraint at each node, which poses a fundamental limit on the network lifetime. We consider two-tiered wireless sensor networks and ...

Journal: :international journal of advanced biological and biomedical research 2014
abazar solgi feridon radmanesh heidar zarei vahid nourani

awareness of the level of river flow and its fluctuations at different times is one of the significant factor to achieve sustainable development for water resource issues. therefore, the present study two hybrid models, wavelet- adaptive neural fuzzy interference system (wanfis) and wavelet- artificial neural network (wann) are used for flow prediction of gamasyab river (nahavand, hamedan, iran...

Journal: :journal of chemical and petroleum engineering 2014
mojtaba ahmadi yasser vasseghian

the main objective of this study is the modelling and optimization of an industrial hydrocracker unit (hu) by means of adaptive neuro fuzzy inference system (anfis) model. in this case, some data were collected from an industrial hydrocracker plant. inputs of an anfis include flow rate of fresh feed and recycle hydrogen, temperature of reactors, mole percentage of h2 and h2s, feed flow rate and...

2005
Dalila B. M. M. Fontes

In this paper, we describe a dynamic programming approach to find optimal trees to the singlesource minimum cost network flow problem with general nonlinear costs. This class of problems is known to be NP-Hard and there is a scarcity of methods to address them. The algorithms previously developed have considered only two particular types of cost functions: “staircase” and “sawtooth”. Here, a dy...

2008
Christian Servin Martine Ceberio

In this paper, we present a tool called the CVP Simulator Tool, which enables users to model a computer network and its connectivity, and detects and eliminates any existing Cascade Vulnerability Problems (CVP). Users can add computers into a network, define what kind of information the computer can hold (e.g., Top Secret, Classified), establish connections between computers, assign a value to ...

Journal: :روش های عددی در مهندسی (استقلال) 0
ناصر طالب بیدختی و رضا وثوق روحانی n. talebbeydokhti and r. v. rohani

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...

In the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. On the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. Effective transport activities are also one of the most important c...

2006
Ross A. Lippert

Problems in partial differential equations with inequality constraints can be used to describe a continuum analog to various optimal flow/cut problems. While general concepts from convex optimization (like duality) carry over into continuum problems, the application of ideas and algorithms from linear programming and network flow problems is challenging. The capacity constraints are non-linear ...

Journal: :Oper. Res. Lett. 2014
Jean Bertrand Gauthier Jacques Desrosiers Marco E. Lübbecke

It is well known that any feasible arc-flow solution to a network problem defined on a graph G = (N,A), where N is the set of nodes whereas A is the set of arcs, can be expressed using at most |A| + |N | paths and cycles having nonzero flow, out of these, at most |A| cycles. This existence theorem is used in a number of proofs establishing the complexity of strongly polynomial algorithms for ne...

2015
Tohid Akbari Mohammad Tavakoli Bina

This paper presents a method in expansion planning of transmission systems using the AC optimal power flow (AC-OPF). The AC-OPF provides a more accurate picture of power flow in the network compared to the DC optimal power flow (DC-OPF) that is usually considered in the literature for transmission expansion planning (TEP). While the AC-OPF-based TEP is a mixed-integer nonlinear programming prob...

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

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