1. Edition - May 2004
169.- Euro
2004. XII, 300 Pages, Hardcover
113 Fig.
- Handbook/Reference Book -
ISBN-10: 3-527-40406-6
ISBN-13: 978-3-527-40406-3 - Wiley-VCH, Berlin








Short description
Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now.
This reference aims to spread the knowledge and encourage their application.


From the contents
Part I: Application in Physics

-Cluster Monte Carlo algorithms (Werner Krauth)
-Probing spin glasses with heuristic optimization algorithms (Olivier C. Martin)
-Computing Exact Ground-States of Hard Ising Spin-Glass Problems by Branch-and-Cut (Frauke Liers, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi)
-Counting States and Counting Operations (A. Alan Middleton)
-Computing Potts´ free energy and submodular functions (J.-C. Anglès d´ Auriac)

Part II: Phase transitions in combinatorial optimization problems

-The random 3-satisfiability problem: From the phase transition to the efficient generation of hard, but satisfiable problem instances (Martin Weigt)
-Analysis of backtracking procedures for random decision problems
(Simona Cocco, Liat Ein-Dor, and Rémi Monasson)
-New iterative algorithms for hard combinatorial problems (Riccardo Zecchina)

Part III: New heuristics and interdisciplinary applications

-Hysteretic optimization (Károly F. Pál)
-Extremal Optimization (Stefan Boettcher)
-Sequence Alignments (Alexander K. Hartmann)
-Protein Folding In Silico - The Quest for Better Algorithms (Ulrich H. E. Hansmann)