Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design

In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along paths between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate that the path relinking procedure offers excellent results. It systematically outperforms the cycle-based tabu search method in both solution quality and computational effort and offers the best current meta-heuristic for this difficult class of problems.     

Blocks with -power character degrees

Let be a -block of a finite group . If is a -power for all , then is nilpotent.

     

Estimates for Wallis’ ratio and related functions

We present improvements of approximation formula for Wallis ratio related to a class of inequalities stated in [D.-J. Zhao, On a two-sided inequality involving Wallis’s formula, Math. Practice Theory, 34 (2004), 166-168], [Y. Zhao and Q. Wu, Wallis inequality with a parameter, J. Inequal. Pure Appl. Math., 7(2) (2006), Art. 56] and [C. Mortici, Completely monotone functions and the Wallis ratio, Applied Mathematics Letters, 25 (2012), 717-722]. Some sharp inequalities are obtained as a result of monotonicity of some functions involving gamma function.     

A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems

This paper presents a parallel tabu search algorithm that utilizes several different neighborhood structures for solving the capacitated vehicle routing problem. Single neighborhood or neighborhood combinations are encapsulated in tabu search threads and they cooperate through a solution pool for the purpose of exploiting their joint power. The computational experiments on 32 large scale benchmark instances show that the proposed method is highly effective and competitive, providing new best solutions to four instances while the average deviation of all best solutions found from the collective best results reported in the literature is about 0.22%. We are also able to associate the beneficial use of special neighborhoods with some test instance characteristics and uncover some sources of the collective power of multi-neighborhood cooperation.     

On Anosov energy levels of hamiltonians on twisted cotangent bundles

LetT ^* M denote the cotangent bundle of a manifoldM endowed with a twisted symplectic structure [1]. We consider the Hamiltonian flow generated (with respect to that symplectic structure) by a convex HamiltonianH: T ^* M, and we consider a compact regular energy level ofH, on which this flow admits a continuous invariant Lagrangian subbundleE. When dimM3, it is known [9] that such energy level projects onto the whole manifoldM, and thatE is transversal to the vertical subbundle. Here we study the case dimM=2, proving that the projection property still holds, while the transversality property may fail. However, we prove that in the case whenE is the stable or unstable subbundle of an Anosov flow, both properties hold.     

Gas‐phase elimination kinetics of selected aliphatic α,β‐unsaturated aldehydes catalyzed by hydrogen chloride

The gas‐phase elimination of 2‐methyl‐2‐propenal catalyzed by HCl yields propene and CO gas, while E‐2‐pentenal with the same catalyst gives butene and CO gas. The kinetics determinations were carried out in a static system with the reaction vessels deactivated with allyl bromide and the presence of the free radical inhibitor toluene. Temperature and pressure ranges were 350.0–410.0 °C and 34–76 Torr. The elimination reactions are homogeneous and unimolecular, and follow a first‐order rate law. The rate coefficients for the reactions are expressible by the following Arrhenius equations: Data from the kinetic and thermodynamic parameters of these catalyzed elimination reactions implies a mechanism of a concerted five‐membered cyclic transition state structure for the formation of the corresponding olefin and carbon monoxide. Copyright © 2015 John Wiley & Sons, Ltd.     

Vertices for characters of -solvable groups

Suppose that is a finite -solvable group. We associate to every irreducible complex character of a canonical pair , where is a -subgroup of and , uniquely determined by up to -conjugacy. This pair behaves as a Green vertex and partitions into ``families" of characters. Using the pair , we give a canonical choice of a certain -radical subgroup of and a character associated to which was predicted by some conjecture of G. R. Robinson.

     

Conjugate gradient method for dual-dual mixed formulations

We deal with the iterative solution of linear systems arising from so-called dual-dual mixed finite element formulations. The linear systems are of a two-fold saddle point structure; they are indefinite and ill-conditioned. We define a special inner product that makes matrices of the two-fold saddle point structure, after a specific transformation, symmetric and positive definite. Therefore, the conjugate gradient method with this special inner product can be used as iterative solver. For a model problem, we propose a preconditioner which leads to a bounded number of CG-iterations. Numerical experiments for our model problem confirming the theoretical results are also reported.

     

Convergence de mesures spectrales aléatoires et applications à des principes d'invariance

Nous présentons un cadre unificateur pour un certain nombre de résultats connus de convergence en loi pour des processus admettant une représentation linéaire par rapport à un bruit blanc faible pour lequel il existe un principe dinvariance faible. Nous montrons que ce principe dinvariance est équivalent à la convergence dune suite de mesures aléatoires spectrales. Ceci permet daffaiblir les hypothèses usuelles et donc dobtenir des résultats nouveaux de convergence en loi, notamment pour des processus à longue portée.     

Optimal Paths for Symmetric Actions in the Unitary Group

Given a positive and unitarily invariant Lagrangian ${\mathcal{L}}$ defined in the algebra of matrices, and a fixed time interval ${[0,t_0]\subset\mathbb R}$ , we study the action defined in the Lie group of ${n\times n}$ unitary matrices ${\mathcal{U}(n)}$ by $$\mathcal{S}(\alpha)=\int_0^{t_0} \mathcal{L}(\dot\alpha(t))\,dt, $$ where ${\alpha:[0,t_0]\to\mathcal{U}(n)}$ is a rectifiable curve. We prove that the one-parameter subgroups of ${\mathcal{U}(n)}$ are the optimal paths, provided the spectrum of the exponent is bounded by π. Moreover, if ${\mathcal{L}}$ is strictly convex, we prove that one-parameter subgroups are the unique optimal curves joining given endpoints. Finally, we also study the connection of these results with unitarily invariant metrics in ${\mathcal{U}(n)}$ as well as angular metrics in the Grassmann manifold.