A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.The first example is a complete branch-and-bound algorithm which either constructs vertex covers of a given size, or proves their non-existence. In the second example, we analyze a class of linear-time heuristic algorithms which contain theanbsp;...
|Title||:||Phase Transitions in Combinatorial Optimization Problems|
|Author||:||Alexander K. Hartmann, Martin Weigt|
|Publisher||:||John Wiley & Sons - 2006-05-12|