Related papers: Fluctuations in the Site Disordered Traveling Sale…
In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. We present a fast combinatorial $\frac…
The existence of fluctuations of temperature has been a somewhat controversial topic in thermodynamics but nowadays it is recognized that they must be taken into account in small, finite systems. Although for nonequilibrium steady states…
Gibbs and Boltzmann definitions of temperature agree only in the macroscopic limit. The ambiguity in identifying the equilibrium temperature of a finite sized `small' system exchanging energy with a bath is usually understood as a…
We study analytically the distribution of fluctuations of the quantities whose average yield the usual two-point correlation and linear response functions in three unfrustrated models: the random walk, the $d$ dimensional scalar field and…
The multi-path Traveling Salesman Problem with stochastic travel costs arises in hybrid vehicle routing applications designed for Smart City and City Logistics, where multiple paths exist between each pair of locations. Travel times along…
We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding…
We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents…
The asymptotic behavior of the optimal TSP tour length is well known from the classical Beardwood--Halton--Hammersley theorem. We extend this result to the Traveling Salesman Problem with Drone (TSPD), a cooperative routing problem in which…
We consider the NP-hard 2-period balanced travelling salesman problem. In this problem the salesman needs to visit a set of customers in two time periods. A given subset of the customers has to be visited in both periods while the rest of…
Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem consists in finding a Hamiltonian tour of least total duration covering the vertices of the graph. The main goal of this work is to…
We study jammed near-crystalline materials composed of frictionless spheres in three dimensions. We analyze the fluctuations in positions and forces produced by small polydispersity in particle sizes. We generalize a recently developed…
In recent years, there has been much interest in phase transitions of combinatorial problems. Phase transitions have been successfully used to analyze combinatorial optimization problems, characterize their typical-case features and locate…
In Facility Location problems there are agents that should be connected to facilities and locations where facilities may be opened so that agents can connect to them. We depart from Uncapacitated Facility Location and by assuming that the…
We give a characterization of completely regular topological spaces. Applying some recent results for supinf problems in completely regular topological spaces we establish a variational principle for saddle points. Well-posedness of saddle…
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly…
The Directed Traveling Salesman Problem (DTSP) is a variant of the classical Traveling Salesman Problem in which the edges in the graph are directed and a vertex and edge can be visited multiple times. The goal is to find a directed closed…
We consider the fluctuation conductivity in the critical region of a disorder induced quantum phase transition in layered d-wave superconductors. We specifically address the fluctuation contribution to the system's conductivity in the limit…
We initiate the study of online routing problems with predictions, inspired by recent exciting results in the area of learning-augmented algorithms. A learning-augmented online algorithm which incorporates predictions in a black-box manner…
We consider a particle dragged through a medium at constant temperature as described by a Langevin equation with a time-dependent potential. The time-dependence is specified by an external protocol. We give conditions on potential and…
Slow parameter drift is common in many systems (e.g., the amount of greenhouse gases in the terrestrial atmosphere is increasing). In such situations, the attractor on which the system trajectory lies can be destroyed, and the trajectory…