相关论文: Remarks on d-Dimensional TSP Optimal Tour Length B…

Effects of possible orbital order in magnetic properties of two-dimensional spin gap system for CaV$_4$O$_9$ are investigated theoretically. After analyzing experimental data, we show that single orbital models assumed in the literature are…

In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

A long standing conjecture says that the integrality ratio of the subtour LP for metric TSP is $4/3$. A well known family of graphic TSP instances achieves this lower bound asymptotically. For Euclidean TSP the best known lower bound on the…

Policy Optimization (PO) algorithms have been proven particularly suited to handle the high-dimensionality of real-world continuous control tasks. In this context, Trust Region Policy Optimization methods represent a popular approach to…

Recent numerical results point to the existence of a conformally invariant twist defect in the critical 3d Ising model. In this note we show that this fact is supported by both epsilon expansion and conformal bootstrap calculations. We find…

We numerically study spin transport and nonequilibrium spin-density profiles in a clean one-dimensional spin-chain with long-range interactions, decaying as a power-law,$r^{-\alpha}$ with distance. We find two distinct regimes of transport:…

Given a point $s$ and a set of $h$ pairwise disjoint polygonal obstacles of totally $n$ vertices in the plane, we present a new algorithm for building an $L_1$ shortest path map of size O(n) in $O(T)$ time and O(n) space such that for any…

The recent observation of B^0_d->\pi^0\pi^0 and \bar{B}^0_d->\pi^0\pi^0 decay modes allows us to make a fresh isospin analysis of B->\pi\pi transitions. We find that current experimental data can impose some model-independent constraints on…

The Multiple Traveling Salesman Problem (MTSP) extends the traveling salesman problem by assigning multiple salesmen to visit a set of targets from a common depot, with each target visited exactly once while minimizing total tour length. A…

We investigate the off-equilibrium dynamics of a classical spin system with $O(n)$ symmetry in $2< D <4$ spatial dimensions and in the limit $n\to \infty$. The system is set up in an ordered equilibrium state is and subsequently driven out…

In the Traveling Salesman Problem with Drones (TSP-mD), a truck and multiple drones cooperate to serve customers in the minimum amount of time. The drones are launched and retrieved by the truck at customer locations, and each of their…

We consider the integrality gap of the subtour LP relaxation of the Traveling Salesman Problem restricted to circulant instances. De Klerk and Dobre conjectured that the value of the optimal solution to the subtour LP on these instances is…

The classical Onofri inequality in the two-dimensional sphere assumes a natural form in the plane when transformed via stereographic projection. We establish an optimal version of a generalization of this inequality in the d-dimensional…

In real-world optimisation, it is common to face several sub-problems interacting and forming the main problem. There is an inter-dependency between the sub-problems, making it impossible to solve such a problem by focusing on only one…

Consider the problem of finding a point in a unit $n$-dimensional $\ell_p$-ball ($p\ge 2$) such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We show in this paper that the recent…

We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP)…

This article proposes a new way of deriving mean-field exponents for sufficiently spread-out Bernoulli percolation in dimensions $d>6$. We obtain an upper bound for the full-space and half-space two-point functions in the critical and…

Beyond the new results mentioned hereafter, this article aims at familiarizing researchers working in applied fields -- such as physics or economics -- with notions or formulas that they use daily without always identifying all their…

Let $T$ be a finite tree graph, $T^N$ be the Cartesian power graph of $T$, and $d^N$ be the graph distance metric on $T^N$. Also let \[ \mathbb S_r^N(x) := \{v \in T^N: d^N(x,v) = r\} \] be the sphere of radius $r$ centered at $x$ and $M$…