Statistical mechanics methods and phase transitions in optimization problems

Abstract

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 many other relations that lead to close ties between computer science and statistical physics. This review aims at presenting the tools and concepts designed by physicists to deal with optimization or decision problems in an accessible language for computer scientists and mathematicians, with no prerequisites in physics. We first introduce some elementary methods of statistical mechanics and then progressively cover the tools appropriate for disordered systems. In each case, we apply these methods to study the phase transitions or the statistical properties of the optimal solutions in various combinatorial problems. We cover in detail the Random Graph, the Satisfiability, and the Traveling Salesman problems. References to the physics literature on optimization are provided. We also give our perspective regarding the interdisciplinary contribution of physics to computer science.

Review article, 80 pages, uses elsart.cls

References in corpus (6)

• A variational description of the ground state structure in random satisfiability problems
• Simplest random K-satisfiability problem
• Trajectories in phase diagrams, growth processes and computational complexity: how search algorithms solve the 3-Satisfiability problem
• A Conjecture on random bipartite matching
• The stochastic traveling salesman problem: Finite size scaling and the cavity prediction
• Frustrated Systems: Ground State Properties via Combinatorial Optimization