Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...

in this paper the concept of the minimum universal cost flow (mucf) for an infeasible flow network is introduced. a new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. a polynomial time algorithm is presented to find the mucf.

‎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...

abstract. suppose g is an nvertex and medge simple graph with edge set e(g). an integervalued function f: e(g) → z is called a flow. tutte was introduced the flow polynomial f(g, λ) as a polynomial in an indeterminate λ with integer coefficients by f(g,λ) in this paper the flow polynomial of some dendrimers are computed.

We develop a new method for studying the asymptotics of symmetric polynomials of representation–theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems concerning characters of infinite–dimensional unitary group and their q– deformations. We study the behavior of uniformly random lozenge tilings of large poly...

We strengthen previously applied polynomial techniques for investigation of spherical designs to obtain new bounds on inner products in some class of designs. This allows further improvements on the best known lower bounds for the minimum possible odd cardinality of designs of odd strength either in small dimensions and in certain asymptotic process.