Network Flow Problems and Algorithms
Maximum network flow approach for fuzzy transportation problems
... maximum network flow technique is that seek to maximize the flow through a flow network from a single source to a single sink, while minimizing the cost of that ...maximum flow ...
6
An Ant Colony Algorithm for Solving Bi-criteria Network Flow Problems in Dynamic Networks
... dynamic network, this present study has used two new algorithms for figuring out bi-criteria network flow problems in discrete time ...the flow of traversing through the dynamic ...
15
Implement and Test Algorithm Finding Maximal Flow Limited Cost in Extended Multi commodity Multicost Network
... maximal flow limited cost problems on extended multicommodity multicost networks is introduced in section ...finding algorithms is used to implement the general algorithm finding the maximum ...
9
Meta heuristic algorithms for optimized network flow wavelet based image coding
... complex problems because of the many potential intermediate destinations an MDC packet might traverse before reaching its final destination ...various algorithms have been proposed to provide greater and ...
34
Secure and Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
... a flow network in bipartite ...data-oblivious algorithms for rank computation based on Gaussian elimination and Gram-Schmidt process, the complexity of which is cubic in the number vertices in the ...
24
Iterative algorithms for monotone inclusion problems, fixed point problems and minimization problems
... inequality problems, generalized equilibrium problems, convex minimization problems, and fixed point problems, we can also refer to [–] and the references ...above-mentioned problems ...
23
Superimposed algorithms for the split equilibrium problems and fixed point problems
... Such problems arise in the field of intensity-modulated radia- tion therapy when one attempts to describe physical dose constraints and equivalent uni- form dose constraints within a single ...
15
The Resolution of Packing Problems Using Simulated Annealing and Genetic Algorithms
... the algorithms was compared with those generated by the pro- gramme supplied by the manufacturer of the machin- ...The algorithms were shown to work better in most cases. The two algorithms were also ...
6
Packet Flow Rate to Protect Wireless Sensor Networks from Wormhole and Hello Flood Attacks
... Silva et al. (2005) propose the first and the most cited rule-based intrusion detection scheme for WSN to detect many different kinds of attacks in different layers. In this scheme, there are three main phases involved: ...
7
Solving dynamic optimal power flow problems using pso and de algorithms
... become necessary to solve the OPF problem in each hour considering economic and security aspects and is termed as dynamic optimal power flow (DOPF). The DOPF is actually the extended formulations of the original ...
6
The occurrence and origin of salinity in non-coastal groundwater in the Waikato region
... Though the research is ongoing, several components have reached their natural conclusion and can be reported. Analytical modelling has been completed and has highlighted the complexity of what would otherwise seem a ...
403
Dynamic optimal power flow for active distribution networks
... Active Network Management is a philosophy for the operation of distribution networks with high penetrations of renewable distributed ...Active Network Management (ANM) ...as network power flow ...
11
Reduction of Maximum Flow Network Interdiction Problem: Step towards the Polynomial Time Solutions
... time algorithms were developed on planner graphs for ...approximation algorithms for ...approximation algorithms for some sections of ...approximation algorithms for combinatorial optimization ...
5
Optimization Problems And Genetic Algorithms
... optimization problems such as planning one’s daily schedule to minimize the time one spends running around between errands or choosing portfolios of financial instruments based on certain risk preferences and ...
6
An effective depression filling algorithm for DEM based 2 D surface flow modelling
... filling algorithms for high resolution ...termine flow paths and spatial partition of watersheds in one pass of processing by employing the innovative concepts of spill elevation and using least-cost search ...
11
On algorithms with good mesh properties for problems with moving boundaries based on the harmonic map heat flow and the DeTurck trick
... solution of some underlying PDE, the objective of our approach is to provide a good mesh for evolving submanifolds undergoing large deformations, where the submanifold is allowed to have any dimension or codimension. We ...
37
Iterative PSO Algorithms for GRAP Problems
... For the improved fyffe [3,11] problem, the component types, reliability, price and weight data of 14 subsystems are listed in Table 1. The cost constraints of the system are 130 units, and the weight constraints of the ...
7
The 2-Tuple Domination Problem on Circular-arc Graphs
... location problems, where the number of facilities ...in problems involving finding sets of representatives, in monitoring communication or electrical networks, and in land surveying ...for network ...
11
Solving Quadratic Assignment Problem Using Water Cycle Optimization Algorithm
... optimization problems that, in many firms have done various researches in order to devote some facilities to some ...optimization problems observed in many operational and practical ...optimization ...
5
Finite algorithms for linear optimisation problems
... FINITE ALGORITHMS FOR LINEAR OPTIMISATION PROBLEMS by Va vid I ce aJtk A thesis submitted to the Australian National University for the degree of Doctor of Philosophy J anuary, 1981 (i) ACKNOWLEDGEMEN[.] ...
133