نتایج جستجو برای: hamiltonian

تعداد نتایج: 32111  

M. Momeni, M. Sarmadi , M. Yaghini,

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...

A. Abdi, S.A. Hosseini

In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...

Journal: :bulletin of the iranian mathematical society 0
n. ‎hoseini department of pure mathematics, ferdowsi university of mashhad, mashhad, iran. a. erfanian department of pure mathematics, ferdowsi university of mashhad, mashhad, iran. a. azimi department of pure mathematics, ferdowsi university of mashhad, mashhad, iran. m. farrokhi d. g. department of pure mathematics, ferdowsi university of mashhad, mashhad, iran.

‎let $r$ be a commutative ring with non-zero identity. ‎we describe all $c_3$‎- ‎and $c_4$-free intersection graph of non-trivial ideals of $r$ as well as $c_n$-free intersection graph when $r$ is a reduced ring. ‎also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎finally, ‎we shall prove that almost all artin rings $r$ have hamiltonian intersection graphs. ...

2015
Edward Meeds Robert Leenders Max Welling

Approximate Bayesian computation (ABC) is a powerful and elegant framework for performing inference in simulation-based models. However, due to the difficulty in scaling likelihood estimates, ABC remains useful for relatively low-dimensional problems. We introduce Hamiltonian ABC (HABC), a set of likelihood-free algorithms that apply recent advances in scaling Bayesian learning using Hamiltonia...

Journal: :transactions on combinatorics 2012
rushengul hoshur elkin vumar

in this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. we present some sufficient and necessary conditions for $gbox h$ being hamilton-connected when $g$ is a hamilton-connected graph and $h$ is a tree or $g$ is a hamiltonian graph and $h$ is $k_2$.

Journal: :The European Physical Journal B 2004

Journal: :journal of sciences islamic republic of iran 0

in this research we described the effective hamiltonian theory and applied this theory to the calculation of current-current (q1,2) and qcd penguin (q3,…,6) c quark decay rates. we calculated the decay rates of semileptonic and hadronic of charm quark in the effective hamiltonian theory. we investigated the decay rates of d meson decays according to spectator quark model (sqm) for the calculati...

Journal: :SIAM Journal on Matrix Analysis and Applications 2000

Journal: :Linear Algebra and its Applications 1999

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید