A Riesz space-fractional reaction–dispersion equation (RSFRDE) is obtained from the classical reaction–dispersion equation (RDE) by replacing the second-order space derivative with a Riesz derivative of order β∈(1,2]. In this paper, using Laplace and Fourier transforms, we obtain the fundamental solution for a RSFRDE. We propose an explicit finite-difference approximation for a RSFRDE in a bounded spatial domain, and analyse its stability and convergence. Some numerical examples are presented.

The finite difference solution of the Dirichlet problem on rectangles when a boundary function is given from C1,1 is analyzed. It is shown that the maximum error for a nine-point approximation is of the order of O(h2(|ln  h|+1)) as a five-point approximation. This order can be improved up to O(h2) when the nine-point approximation in the grids which are a distance h from the boundary is replaced by a five-point approximation (“five and nine”-point scheme). It is also proved that the class of boundary functions C1,1 used to obtain the error estimations essentially cannot be enlarged. We provide numerical experiments to support the analysis made. These results point at the importance of taking the smoothness of the boundary functions into account when choosing the numerical algorithms in applied problems.

A new sharp L2 inequality of Ostrowski type is established, which provides some other interesting results as special cases. Applications in numerical integration are also given.

The computation of leastcore and prenucleolus is an efficient way ofallocating a common resource among n players. It has, however,the drawback being a linear programming problem with2n - 2 constraints. In this paper we showhow, in the case of convex production games, generate constraints by solving small sizelinear programming problems,with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially continuous coalitions. We also study thecomputation of prenucleolus, and display encouraging numerical results.

In this paper we establish necessary as well assufficient conditions for a given feasible point to be a globalminimizer of smooth minimization problems with mixed variables.These problems, for instance, cover box constrained smooth minimizationproblems and bivalent optimization problems. In particular, ourresults provide necessary global optimality conditions for differenceconvex minimization problems, whereas our sufficient conditionsgive easily verifiable conditions for global optimality of variousclasses of nonconvex minimization problems, including the class ofdifference of convex and quadratic minimization problems. Wediscuss numerical examples to illustrate the optimalityconditions

Let M be an n-dimensional space-like hypersurface in a locally symmetric Lorentz space, with n(n−1)R=κH(κ>0) and satisfying certain additional conditions on the sectional curvature. Denote by S and H the squared norm of the second fundamental form and the mean curvature of M, respectively. We show that if the mean curvature is nonnegative and attains its maximum on M, then:

1. (1) if H2<4(n−1)c/n2, M is totally umbilical;

2. (2) if H2=4(n−1)c/n2, M is totally umbilical or is an isoparametric hypersurface;

3. (3) if H2>4(n−1)c/n2 and S satisfies some pinching conditions, M is totally umbilical or is an isoparametric hypersurface.

The hyper-Wiener index of a connected graph G is defined as , where V (G) is the set of all vertices of G and d(u,v) is the distance between the vertices u,v∈V (G). In this paper we find an exact expression for the hyper-Wiener index of TUHC6[2p,q], the zigzag polyhex nanotube.

An algorithm for enumerating all nondominated vectors of multiple objectiveinteger linear programs is presented. The method tests different regionswhere candidates can be found using an auxiliary binary problem for trackingthe regions already explored. An experimental comparision with our previousefforts shows the method has relatively good time performance.

The steady response of the free surface of a fluid in a porous medium is considered during extraction of the fluid through a line sink. A conformal-mapping approach is used to derive exact solutions to a family of problems in which the line sink is placed at the apex of a wedge-shaped impermeable base, including the limiting cases of an unbounded aquifer and a flat-bottomed aquifer of finite depth. Both critical cusp solutions and sub-critical solutions are computed exactly as Fourier sine series.

We give here some extensions of inequalities of Popoviciu and Rado. The idea is to use an inequality [C. P. Niculescu and L. E. Persson, Convex functions. Basic theory and applications (Universitaria Press, Craiova, 2003), Page 4] which gives an approximation of the arithmetic mean of n values of a given convex function in terms of the value at the arithmetic mean of the arguments. We also give more general forms of this inequality by replacing the arithmetic mean with others. Finally we use these inequalities to establish similar inequalities of Popoviciu and Rado type.

There has recently been considerable interest in the stability of stochastic differential equations with Markovian switching, and a number of results have been achieved. However, due to the exponential sojourn time of Markovian chain at each state, there are many restrictions on existing results for practical application. In this paper, we explore the problem of stability in distribution of nonlinear systems with time-varying delays and semi-Markov switching. Unlike existing models, the new model takes into account noise, time-varying delays and semi-Markov switching. By means of stochastic analysis, functional analysis and inequality techniques, sufficient conditions are obtained to guarantee the stability of the systems concerned. The proposed results are new and extend existing ones.

We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic with A0,A1∈𝒞n×n and (where or H). The perturbation of eigenvalues in the context of general matrix polynomials, palindromic pencils, (semi-Schur) anti-triangular canonical forms and differentiation is discussed.

This article deals with the vehicle routing problem with timewindows (VRPTW). This problem consists in determining a least-costset of trips to serve customers during specific time windows. Theproposed solution method is a memetic algorithm (MA), a geneticalgorithm hybridised with a local search. Contrary to most paperson the VRPTW, which minimize first the number of vehicles, ourmethod is also able to minimize the total distance travelled. Theresults on 56 classical instances are compared to those of thebest metaheuristics. The efficiency of the MA is similar for theclassical criterion, but it becomes the best algorithm availablefor the total distance, being much faster and improving 20best-known solutions.

We design a O(n3) polynomial time algorithm for finding a (k-1)- regular subgraph in a k-regular graph without any induced star K 1,3(claw-free). A polynomial time algorithm for finding a cubic subgraph in a 4-regular locally connected graph is also given. A family of k-regular graphs with an induced star K 1,3 (k even, k ≥ 6), not containing any (k-1)-regular subgraph is also constructed.

This paper deals the global existence and blow-up properties of the following non-Newton polytropic filtration system with nonlocal source, Under appropriate hypotheses, we prove that the solution either exists globally or blows up in finite time depending on the initial data and the relations between αβ and mn(p−1)(q−1). In the special case, α=n(q−1), β=m(p−1), we also give a criteria for the solution to exist globally or blow up in finite time, which depends on a,b and ζ(x),ϑ(x) as defined in our main results.

This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical line-searches.

Many combinatorial optimization problems can be formulated asthe minimization of a 0–1 quadratic function subject to linear constraints. Inthis paper, we are interested in the exact solution of this problem through atwo-phase general scheme. The first phase consists in reformulating theinitial problem either into a compact mixed integer linear program or into a0–1 quadratic convex program. The second phase simply consists insubmitting the reformulated problem to a standard solver. The efficiency ofthis scheme strongly depends on the quality of the reformulation obtained inphase 1. We show that a good compact linear reformulation can be obtained bysolving a continuous linear relaxation of the initial problem. We also showthat a good quadratic convex reformulation can be obtained by solving asemidefinite relaxation. In both cases, the obtained reformulation profitsfrom the quality of the underlying relaxation. Hence, the proposed scheme getsaround, in a sense, the difficulty to incorporate these costly relaxations ina branch-and-bound algorithm.

In this paper an expansion method, based on Legendre or any orthogonal polynomials, is developed to find numerical solutions of two-dimensional linear Fredholm integral equations. We estimate the error of the method, and present some numerical examples to demonstrate the accuracy of the method.

In this paper, which is an extension of [4],we first show the existence of solutions to a class of Min Sup problems with linked constraints, which satisfy a certain property. Then, we apply our result to a class of weak nonlinear bilevelproblems. Furthermore, for such a class of bilevel problems, wegive a relationship with appropriate d.c. problems concerning theexistence of solutions.

In this paper, we investigate computable lower bounds for the beststrongly ergodic rate of convergence of the transient probability distribution to the stationary distribution for stochastically monotone continuous-time Markov chains and reversible continuous-time Markov chains, using a drift function and the expectation of the first hitting time on some state. We apply these results to birth–death processes, branching processes and population processes.