Search results for "Matematica"
showing 10 items of 1637 documents
A class of weak pseudo-bosons and their bi-coherent states
2022
In this paper we extend some previous results on weak pseudo-bosons and on their related bi-coherent states. The role of {\em compatible} functions is discussed in details, and some examples are considered. The pseudo-bosonic ladder operators analysed in this paper generalize significantly those considered so far, and a class of new diagonalizable manifestly non self-adjoint Hamiltonians are deduced.
Modelling the dynamics of the students’ academic performance in the German region of the North Rhine-Westphalia: an epidemiological approach with unc…
2013
Student academic underachievement is a concern of paramount importance in Europe, where around 15% of the students in the last high school courses do not achieve the minimum knowledge academic requirement. In this paper, we propose a model based on a system of differential equations to study the dynamics of the students academic performance in the German region of North Rhine-Westphalia. This approach is supported by the idea that both, good and bad study habits, are a mixture of personal decisions and influence of classmates. This model allows us to forecast the student academic performance by means of confidence intervals over the next few years.
Fixed point theorems on ordered metric spaces and applications to nonlinear elastic beam equations
2012
In this paper, we establish certain fixed point theorems in metric spaces with a partial ordering. Presented theorems extend and generalize several existing results in the literature. As application, we use the fixed point theorems obtained in this paper to study existence and uniqueness of solutions for fourth-order two-point boundary value problems for elastic beam equations.
On the stability of the Serrin problem
2008
We investigate stability issues concerning the radial symmetry of solutions to Serrin's overdetermined problems. In particular, we show that, if $u$ is a solution to $\Delta u=n$ in a smooth domain $\Omega \subset \rn$, $u=0$ on $\partial\Omega$ and $|Du|$ is close to 1 on $\partial\Omega$, then $\Omega$ is close to the union of a certain number of disjoint unitary balls.
Local behaviour of singular solutions for nonlinear elliptic equations in divergence form
2012
We consider the following class of nonlinear elliptic equations $$\begin{array}{ll}{-}{\rm div}(\mathcal{A}(|x|)\nabla u) +u^q=0\quad {\rm in}\; B_1(0)\setminus\{0\}, \end{array}$$ where q > 1 and $${\mathcal{A}}$$ is a positive C 1(0,1] function which is regularly varying at zero with index $${\vartheta}$$ in (2−N,2). We prove that all isolated singularities at zero for the positive solutions are removable if and only if $${\Phi\not\in L^q(B_1(0))}$$ , where $${\Phi}$$ denotes the fundamental solution of $${-{\rm div}(\mathcal{A}(|x|)\nabla u)=\delta_0}$$ in $${\mathcal D'(B_1(0))}$$ and δ0 is the Dirac mass at 0. Moreover, we give a complete classification of the behaviour near zero of al…
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.
Arc routing problems: A review of the past, present, and future
2020
[EN] Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emergin…
New Heuristic Algorithms for the Windy Rural Postman Problem
2005
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
2016
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.