The capacitated single-allocation hub location problem revisited: A note on a classical formulation

In this paper a well-known formulation for the capacitated single-allocation hub location problem is revisited. An example is presented showing that for some instances this formulation is incomplete. The reasons for the incompleteness are identified leading to the inclusion of an additional set of constraints. Computational experiments are performed showing that the new constraints also help to decrease the computational time required to solve the problem optimally.     

Strategic oscillation for the quadratic multiple knapsack problem

The quadratic multiple knapsack problem (QMKP) consists in assigning a set of objects, which interact through paired profit values, exclusively to different capacity-constrained knapsacks with the aim of maximising total profit. Its many applications include the assignment of workmen to different tasks when their ability to cooperate may affect the results. Strategic oscillation (SO) is a search strategy that operates in relation to a critical boundary associated with important solution features (such as feasibility). Originally proposed in the context of tabu search, it has become widely applied as an efficient memory-based methodology. We apply strategic oscillation to the quadratic multiple knapsack problem, disclosing that SO effectively exploits domain-specific knowledge, and obtains solutions of particularly high quality compared to those obtained by current state-of-the-art algorithms.     

Existence and Multiplicity of Radial Positive Solutions for a Quasilinear Elliptic Equation with Sign-Changing Nonlinearity

In this paper we will be concerned with questions of existence and multiplicity of radial nonnegative solutions of the quasilinear elliptic equation We will use variational methods in order to prove the existence of multiple solutions in case f is a sign-changing nonlinearity.     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.     

A general reduction scheme for the time-dependent Born–Oppenheimer approximation

We construct a general reduction scheme for the study of the quantum propagator of molecular Schrödinger operators with smooth potentials. This reduction is made up to infinitely (resp. exponentially) small error terms with respect to the inverse square root of the mass of the nuclei, depending on the C^∞ (resp. analytic) smoothness of the interactions. Then we apply this result to the case when an electronic level is isolated from the rest of the spectrum of the electronic Hamiltonian. To cite this article: A. Martinez, V. Sordoni, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 185–188.     

Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces

Numerical Algorithms - The main difficulty for solving semi-infinite programming (SIP) problem is precisely that it has infinitely many constraints. By using a maximum function, the SIP problem can...     

A new class of conformable spectral observers for signal reconstruction

In this work, the design of spectral observers for signal reconstruction based on Kalman filters is performed and evaluated. The conformable derivative and the beta‐derivative were used to design the Kalman filters. Both derivatives satisfy the same formulas of the classical derivation, eg, the chain rule. The derivative order, the Ricatti equation parameters, and the observers tuning parameters were optimized using an optimization algorithm based on the bat's echolocation behavior (Bat algorithm). The simulation results showed the advantages of using the proposed observers for the signal reconstruction.