On a wave equation with supercritical interior and boundary sources and damping terms

This article addresses nonlinear wave equations with supercritical interior and boundary sources, and subject to interior and boundary damping. The presence of a nonlinear boundary source alone is known to pose a significant difficulty since the linear Neumann problem for the wave equation is not, in general, well‐posed in the finite‐energy space H¹(Ω) × L₂(?Ω) with boundary data in L₂ due to the failure of the uniform Lopatinskii condition. Further challenges stem from the fact that both sources are non‐dissipative and are not locally Lipschitz operators from H¹(Ω) into L₂(Ω), or L₂(?Ω). With some restrictions on the parameters in the model and with careful analysis involving the Nehari Manifold, we obtain global existence of a unique weak solution, and establish exponential and algebraic uniform decay rates of the finite energy (depending on the behavior of the dissipation terms). Moreover, we prove a blow up result for weak solutions with nonnegative initial energy.     

On the Hilbert Evolution Algebras of a Graph

Evolution algebras are a special class of nonassociative algebras exhibiting connections with various fields of mathematics. Hilbert evolution algebras generalize the concept in the framework of Hilbert spaces. This allows us to deal with a wide class of infinite-dimensional spaces. We study Hilbert evolution algebras associated to a graph. Inspired by the definitions of evolution algebras we define the Hilbert evolution algebra that is associated to a given graph and the Hilbert evolution algebra that is associated to the symmetric random walk on a graph. For a given graph, we provide the conditions for these structures to be or not to be isomorphic. Our definitions and results extend to the graphs with infinitely many vertices. We also develop a similar theory for the evolution algebras associated to finite graphs.

     

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis

The attributes of vehicle routing problems are additional characteristics or constraints that aim to better take into account the specificities of real applications. The variants thus formed are supported by a well-developed literature, including a large variety of heuristics. This article first reviews the main classes of attributes, providing a survey of heuristics and meta-heuristics for Multi-Attribute Vehicle Routing Problems (MAVRP). It then takes a closer look at the concepts of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with different attributes. This cross-analysis leads to the identification of “winning strategies” in designing effective heuristics for MAVRP. This is an important step in the development of general and efficient solution methods for dealing with the large range of vehicle routing variants.     

On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Necessary and Sufficient Conditions for Strong Fenchel–Lagrange Duality via a Coupling Conjugation Scheme

Given a general primal problem and its Fenchel–Lagrange dual one, which is obtained by using a conjugation scheme based on coupling functions and the perturbational approach, the aim in this work is to establish conditions under which strong duality can be guaranteed. To this purpose, even convexity and properness are a compulsory requirement over the involved functions in the primal problem. Furthermore, two closedness-type regularity conditions and a characterization for strong duality are derived.     

A study on exponential-size neighborhoods for the bin packing problem with conflicts

We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various application contexts such as logistics and transportation, timetabling, and resource allocation for cloud computing. We introduce \({\mathcal O}(1)\) evaluation procedures for classical local-search moves, polynomial variants of ejection chains and assignment neighborhoods, an adaptive set covering-based neighborhood, and finally a controlled use of 0-cost moves to further diversify the search. The overall method produces solutions of good quality on the classical benchmark instances and scales very well with an increase of problem size. Extensive computational experiments are conducted to measure the respective contribution of each proposed neighborhood. In particular, the 0-cost moves and the large neighborhood based on set covering contribute very significantly to the search. Several research perspectives are open in relation to possible hybridizations with other state-of-the-art mathematical programming heuristics for this problem.     

Implicit depot assignments and rotations in vehicle routing heuristics

Vehicle routing variants with multiple depots and mixed fleet present intricate combinatorial aspects related to sequencing choices, vehicle type choices, depot choices, and depots positioning. This paper introduces a dynamic programming methodology for efficiently evaluating compound neighborhoods combining sequence-based moves with an optimal choice of vehicle and depot, and an optimal determination of the first customer to be visited in the route, called rotation. The assignment choices, making the richness of the problem, are thus no more addressed in the solution structure, but implicitly determined during each move evaluation. Two meta-heuristics relying on these concepts, an iterated local search and a hybrid genetic algorithm, are presented. Extensive computational experiments demonstrate the remarkable performance of these methods on classic benchmark instances for multi-depot vehicle routing problems with and without fleet mix, as well as the notable contribution of the implicit depot choice and positioning methods to the search performance. New state-of-the-art results are obtained for multi-depot vehicle routing problems (MDVRP), and multi-depot vehicle fleet mix problems (MDVFMP) with unconstrained fleet size. The proposed concepts are fairly general, and widely applicable to many other vehicle routing variants.     

Search for color singlet technicolor particles in p&pmacr; collisions at radicals = 1.8 TeV

We search for color singlet technirho and technipion production in p&pmacr; collisions at sqrt[s] = 1.8 TeV recorded with the Collider Detector at Fermilab. These exotic technimesons are present in a model of walking technicolor. The signatures studied are lepton plus two jets plus E(T) and multijet final states. No excess of events is seen in either final state. We set an upper limit on the technirho production cross section and exclude a region in the technipion mass versus technirho mass plane.     

Observation of diffractive b-quark production at the fermilab tevatron

We report a measurement of the fraction of b quarks produced diffractively in &pmacr;p collisions at sqrt[s] = 1.8 TeV. Diffraction is identified by the absence of particles in a forward pseudorapidity region. From events with an electron of transverse momentum 9.5相似文献   

Diffractive dijets with a leading antiproton in &pmacr;p collisions at sqrt

We report results from a study of events with a leading antiproton of beam momentum fraction 0.9057 GeV. Using the dijet events, we evaluate the diffractive structure function of the antiproton and compare it with expectations based on results obtained in diffractive deep inelastic scattering experiments at the DESY ep collider HERA.