We review here some recent work in the field of quantum annealing, alias adiabatic
quantum computation. The idea of quantum annealing is to perform optimization by a …

The random assignment (or bipartite matching) problem asks about An= minπ∑ c (i, π (i)),
where (c (i, j)) is an× n matrix with iid entries, say with exponential (1) distribution, and the …

Recently, it has been recognized that phase transitions play an important role in the
probabilistic analysis of combinatorial optimization problems. However, there are in fact …

The path integral Monte Carlo simulated quantum annealing algorithm is applied to the
optimization of a large hard instance of the random satisfiability problem (N= 10 000). The …

Computer science and physics have been closely linked since the birth of modern
computing. In recent years, an interdisciplinary area has blossomed at the junction of these …

We investigate the value of choosing the next stop to visit in a multistop trip based on current
traffic conditions to minimize the expected total travel time of the tour. We model this problem …

Freight trucks are known to be a major source of air pollutants as well as greenhouse gas
emissions in US metropolitan areas, and they have significant effects on air quality and …

The edges of a complete graph on n vertices are assigned iid random costs from a
distribution for which the interval [0, t] has probability asymptotic to t as t→ 0 through positive …

During self-guided behaviors, animals identify constraints of the problems they face and
adaptively employ appropriate strategies. In the case of foraging, animals must balance …

In a landscape composed of N randomly distributed sites in Euclidean space, a walker
(“tourist”) goes to the nearest one that has not been visited in the last τ steps. This procedure …