نتایج جستجو برای: flow polynomial
تعداد نتایج: 576526 فیلتر نتایج به سال:
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
Systems of polynomial equations arise naturally in applications ranging from the study of chemical reactions to coding theory to geometry and number theory. Furthermore, the complexity of the equations we wish to solve continues to rise: while engineers in ancient Egypt needed to solve quadratic equations in one variable, today we have applications in satellite orbit design and combustive fluid...
For every $1leq s< n$, the $s^{th}$ derivative of a polynomial $P(z)$ of degree $n$ is a polynomial $P^{(s)}(z)$ whose degree is $(n-s)$. This paper presents a result which gives generalizations of some inequalities regarding the $s^{th}$ derivative of a polynomial having zeros outside a circle. Besides, our result gives interesting refinements of some well-known results.
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...
We explore here surprising links between the time-cost-tradeoff problem and the minimum cost flow problem that lead to faster, strongly polynomial, algorithms for both problems. One of the main results is a new algorithm for the unit capacity min cost flow that culminates decades of efforts to match the complexity of the fastest strongly polynomial algorithm known for the assignment problem. Th...
for a polynomial p(z) of degree n, having all zeros in |z|< k, k< 1, dewan et al [k. k. dewan, n. singh and a. mir, extension of some polynomial inequalities to the polar derivative, j. math. anal. appl. 352 (2009) 807-815] obtained inequality between the polar derivative of p(z) and maximum modulus of p(z). in this paper we improve and extend the above inequality. our result generalizes certai...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید