Related papers: Fluctuations in the Site Disordered Traveling Sale…
The application of thermodynamic reasoning in the study of learning systems has a long tradition. Recently, new tools relating perfect thermodynamic adaptation to the adaptation process have been developed. These results, known as…
The Steiner Traveling Salesman Problem (STSP) is a variant of the Traveling Salesman Problem (TSP) that is particularly suitable when dealing with sparse networks, such as road networks. The standard integer programming formulation of the…
The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) addresses such…
This paper explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling Salesperson Problem with Circle Placement (TSP-CP), the aim…
We analyze the fluctuations in particle positions and inter-particle forces in disordered jammed crystals in the limit of weak disorder. We demonstrate that such athermal systems are fundamentally different from their thermal counterparts,…
We theoretically study divergent fluctuations of dynamical events at non-ergodic transitions. We first focus on the finding that a non-ergodic transition can be described as a saddle connection bifurcation of an order parameter for a time…
In the Traveling Salesman Problem (TSP), a list of cities and the distances between them are given. The goal is to find the shortest possible route that visits each city exactly once and returns to the original city. The TSP has a wide…
We present a new method to study disordered systems in the low temperature limit. The method uses the replicated Hamiltonian. It studies the saddle points of this Hamiltonian and shows how the various saddle point contributions can be…
In this paper some critical aspects of the behaviour of breaking lattices subject to slow driving forces are briefly reviewed. In particular fluctuations in the response to the variation of external parameters are discussed.
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
The Dubins Traveling Salesman Problem (DTSP) has generated significant interest over the last decade due to its occurrence in several civil and military surveillance applications. Currently, there is no algorithm that can find an optimal…
We study a symmetry broken harmonic oscillator in contact with a heat bath characterized by a fixed temperature. The overdampped system is solved exactly to show symmetry broken directed transport raising the question whether…
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0,…
We analyze thermodynamic bounds on equilibrium fluctuations of an order parameter, which are analogous to relations, which have been derived recently in the context of non-equilibrium fluctuations of currents. We discuss the case of {\it…
Proposed initially from a practical circumstance, the traveling salesman problem caught the attention of numerous economists, computer scientists, and mathematicians. These theorists were instead intrigued by seeking a systemic way to find…
The principal aim of the present work is to explore limit theorems for small random perturbations of a planar impulsive dynamical system, where impulses occur at hitting times of a suitable switching surface, and are thus state-dependent.…
Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$. We…
We continue to develop a new approach to description of charge kinetics in disordered semiconductors. It is based on fractional diffusion equations. This article is devoted to transient processes in structures under dispersive transport…
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a…
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. (The…