The dynamic network loading problem (DNLP) consists in determining on a congested network, timedependent arc volumes, together with arc and path travel times, g
The definitions of generalized pseudoconvex,generalized quasiconvex and its strictly generalized convexity were presented for the static programming at locally
Let ARDkCS(v) denote an almost resolvable directed k-cycle system of order v. It is clear that a necessary condition for the existence of an ARDkCS(v) is v≡1(m
This paper studied spherical pulses of solutions of the system of semilinear wave equations with the pulses focusing at a point in three space variables. It is