A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery

This paper addresses a location-routing problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. We propose an effective branch-and-cut algorithm for solving the LRPSPD. The proposed algorithm implements several valid inequalities adapted from the literature for the problem and a local search based on simulated annealing algorithm to obtain upper bounds. Computational results, for a large number of instances derived from the literature, show that some instances with up to 88 customers and 8 potential depots can be solved in a reasonable computation time.     

Stabilized mixed triangular finite elements at large deformations using area bubble functions

In this paper stabilized mixed triangular finite elements are presented in order to avoid volume locking and to damp stress oscillations. Geometrically non-linear elastic problems are addressed. The mixed method of incompatible modes and the mixed method of enhanced strains are considered as special cases. As a key idea, volume and area bubble functions are used for the method of incompatible modes and the enhanced strain method [1], thus giving both the interpretation of a mixed finite element method with stabilization terms. Concerning non-linear problems these are non-linearly dependent on the current deformation state, however, linearly dependent stabilization terms are used [1]. The approach becomes most attractive for the numerical implementation, since the use of quantities related to the previous Newton iteration step is completely avoided. The variational formulation for the standard two-field method, the method of incompatible modes and the enhanced strain method in finite deformation problems is derived for a hyper elastic Neo-Hookean material. In the representative example Cook's membrane problem illustrates the good performance of the presented approaches compared to existing finite element formulations. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Soc-Injective Rings and Modules*

If M and N are right R-modules, M is called Socle-N-injective (Soc-N-injective) if every R-homomorphism from the socle of N into M extends to N. Equivalently, for every semisimple submodule K of N, any R-homomorphism f : K → M extends to N. In this article, we investigate the notion of soc-injectivity.     

Numerical solution of a coupled Korteweg–de Vries equations by collocation method

A numerical method for solving the coupled Korteweg‐de Vries (CKdV) equation based on the collocation method with quintic B‐spline finite elements is set up to simulate the solution of CKdV equation. Invariants and error norms are studied wherever possible to determine the conservation properties of the algorithm. Simulation of single soliton, interaction of two solitons, and birth of solitons are presented. A linear stability analysis shows the scheme to be unconditionally stable. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Validated Infeasible Interior-Point Predictor–Corrector Methods for Linear Programming

Many problems arising in practical applications lead to linear programming problems. Hence, they are fundamentally tractable. Recent interior-point methods can exploit problem structure to solve such problems very efficiently. Infeasible interior-point predictor–corrector methods using floating-point arithmetic sometimes compute an approximate solution with duality gap less than a given tolerance even when the problem may not have a solution. We present an efficient verification method for solving linear programming problems which computes a guaranteed enclosure of the optimal solution and which verifies the existence of the solution within the computed interval.     

On classification of four-dimensional nilpotent Leibniz algebras

Leibniz algebras are certain generalization of Lie algebras. In this paper, we give the classification of four-dimensional non-Lie nilpotent Leibniz algebras. We use the canonical forms for the congruence classes of matrices of bilinear forms and some other techniques to obtain our result.     

Plancherel–Rotach Asymptotic Expansion for Some Polynomials from Indeterminate Moment Problems

We study the Plancherel–Rotach asymptotics of four families of orthogonal polynomials: the Chen–Ismail polynomials, the Berg–Letessier–Valent polynomials, and the Conrad–Flajolet polynomials I and II. All these polynomials arise in indeterminate moment problems, and three of them are birth and death process polynomials with cubic or quartic rates. We employ a difference equation asymptotic technique due to Z. Wang and R. Wong. Our analysis leads to a conjecture about large degree behavior of polynomials orthogonal with respect to solutions of indeterminate moment problems.     

Embedded diagonally implicit Runge–Kutta–Nystrom 4(3) pair for solving special second-order IVPs

In this paper, third-order 3-stage diagonally implicit Runge–Kutta–Nystrom method embedded in fourth-order 4-stage for solving special second-order initial value problems is constructed. The method has the property of minimized local truncation error as well as the last row of the coefficient matrix is equal to the vector output. The stability of the method is investigated and a standard set of test problems are tested upon and comparisons on the numerical results are made when the same set of test problems are reduced to first-order system and solved using existing Runge–Kutta method. The results clearly shown the advantage and the efficiency of the new method.