AAU Institutional Repository

# Browsing Mathematics by Title

Sort by: Order: Results:

This dissertation is motivated by practical problem of traffic flow on roundabouts. The study aimed at modelling traffic flow on roundabouts, proposing an optimization strategy for traffic flow on roundabouts and ...
This paper presents every K4-free graph G with n vertices can be made bipartite by deleting at most n2 9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph ...
In ecology, the food chain pyramid suggests that there must be less consumers than their food source. In our case the balance in the population of plants and herbivores should be maintained in the ecosystem. Otherwise, ...
The maximum Modulus Theorem expressing one of the basic properties of the modulus of analytic function. The purpose of this paper is to present some variants of the maximum modulus theorem and present the application of ...
In this project we discussed the maximum principle for elliptic equations state several theorems, corollaries, and give a number of examples. Although the maximum principle for Laplace's and some other equations has been ...
Let (Ωμ) be a measure space, and:Ω→ Ω such that for al. Then μ is said to be invariant with respect to if μ)=μ. If is invariant with respect to and is also a probability measure, then the quadruple (Ω) is called a measurable ...
The complete set of this paper focuses on maximum cardinality matching and minimum cost maximum cardinality matching problem with their algorithms which solve cardinality matching in a graph G=(N,A)where N is set of N ...
This work presents an algorithm for computing the maximum flow and minimum cost flow problem of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm ...
The Minimum Cost Network Flow (MCNF) Problem is to send flow from a set of supply or source nodes, through the arcs of a network, to a set of demand or destination nodes, at minimum total cost, and without violating the ...
Tuberculosis is an infectious disease, which is affecting a third of the world's popula- tion, that makes Tuberculosis a global health problem. Many countries are trying to eliminate the disease but the emergence of ...
Most of the Real world decision making problems have multiple objectives, which cannot be optimized simultaneously due to the conicting nature of the objectives. Such problems can be solved by various methods to obtain ...
The concept of Boolean like rings is originally due to A.L.Foster, in 1946. Later, in 1982, V. Swaminathan has extensively studied the geometry of Boolean like rings. Recently in 2011, Venkateswarlu et al introduced the ...
This project paper is divided into four sections. we discuss the origin of Motzkin numbers using the division of finite number of points on a circle by non-intersecting chords. The idea of division of finite number of ...
This paper presents one way of getting a maximum or minimum cost about given Capacitated transportation problem for certain company. The understanding the transportation cost prob- lem of company with a bounded rim ...
The objective of this study was to assess and examine the current status of municipal solid waste management practices in the city of Sabata, Oromia Special Zone, surrounding Finfine in Oromia Regional State of Ethiopia. ...
This project is conserned with a network and its applications. The project begins with pre-concepts of graph theory and focuses on one of the the well known application of graph theory called networks. The project on its ...
In this paper we study some of the non-oscillatory criteria on half- linear di_erential equation of the form (r(t)_(x)+(T)-=0Where (z)=(x)p-z z-p>1 Using modi_ed Riccati technique. In addition to that we are going to ...
Some times there may be many di®erent ways to model a particular problem, choosing the best one minimizes the complexity of the problem and time to solve. Since, as we have said earlier, any programming problem with ...
Stochastic chance-constrained programming is mainly concerned with the problem that the decision maker must give his solution before the random variables come true. In this problem, the probability of decision satisfying ...