In the present work an attempt is being made to reduce the Maximum Flow Network Interdiction Problem (MFNIP) in to the Subset Sum Problem so as to get some algorithms solvable in polynomial time. Previously developed algorithms are either applicable to some special cases of MFNIP or they do not have a constant performance guarantee. Our reduction has paved the way towards the development of ful...

In this paper we give a flow model on directed multigraphs by introducing reflexions of generalized polymatroids at vertices as constraints for the flow conservation. This model has the essential features of the classical flow model, primarily the max-flow min-cut theorem and the polynomial algorithm for computing the maximal feasible (integral) flow.

‎this paper obtains the exact solutions of the wave equation as a second-order partial differential equation (pde)‎. ‎we are going to calculate polynomial and non-polynomial exact solutions by using lie point symmetry‎. ‎we demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎a generalized procedure for polynomial solution is pr...

The equation of a motion of curves in the projective plane is deduced. Local flows are defined in terms of polynomial differential functions. A family of local flows inducing the Kaup–Kupershmidt hierarchy is constructed. The integration of the congruence curves is discussed. Local motions defined by the traveling wave cnoidal solutions of the fifth-order Kaup–Kupershmidt equation are described.

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

The effect of blood hematocrit (HCT) on a noninvasive flow estimation algorithm was examined in a centrifugal implantable rotary blood pump (iRBP) used for ventricular assistance. An average flow estimator, based on three parameters, input electrical power, pump speed, and HCT, was developed. Data were collected in a mock loop under steady flow conditions for a variety of pump operating points ...

The number of nowhere zero ZQ flows on a graph G can be shown to be a polynomial in Q, defining the flow polynomial ΦG(Q). According to Tutte’s five-flow conjecture, ΦG(5) > 0 for any bridgeless G. A conjecture by Welsh that ΦG(Q) has no real roots for Q ∈ (4,∞) was recently disproved by Haggard, Pearce and Royle. These authors conjectured the absence of roots for Q ∈ [5,∞). We study the real r...

Flow cover inequalities are among the most effective valid inequalities for capacitated fixed-charge network flow problems. These valid inequalities are based on implications for the flow quantity on the cut arcs of a two-partitioning of the network, depending on whether some of the cut arcs are open or closed. As the implications are only on the cut arcs, flow cover inequalities can be obtaine...

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.