An Optimal File Transfer on an Undirected Path Network with 2-level Arc Cost

We generalized Definition 5 of close-to-convex univalent functions so that the new class CC) includes p-valent functions.. close-to-convex) and hence any theorem about

Zaslavski, Generic existence of solutions of minimization problems with an increas- ing cost function, to appear in Nonlinear

In [10, 12], it was established the generic existence of solutions of problem (1.2) for certain classes of increasing lower semicontinuous functions f.. Note that the

We have seen that Falk-Soland’s rectangular branch-and-bound algorithm can serve as a useful procedure in solving linear programs with an addi- tional separable reverse

Theorem 1.2 For each connected graph = (f, α) defined in Construction 6.1, with automorphism group A = Aut () given in Proposition 8.1, G is an index two subgroup of A, is

In this paper, by employing a functional inequality introduced in [5], which is an abstract generalization of the classical Jessen’s inequality [10], we further establish the

As a special case of that general result, we obtain new fractional inequalities involving fractional integrals and derivatives of Riemann-Liouville type1. Consequently, we get

One can compute that the last four hypergraphs each have exactly two vertices contained in exactly one large empty cluster; in each case, these are the two lowest vertices of the