New Optimization Algorithms in Physics
1. Auflage Mai 2004
XII, 300 Seiten, Hardcover
113 Abbildungen
Handbuch/Nachschlagewerk
Kurzbeschreibung
Im Forschungsalltag ist vielen Physikern nicht bewusst, dass sich manches Problem durch die Anwendung eines Optimierungsalgorithmus elegant lösen ließe. Die Palette verfügbarer Algorithmen wächst zudem ständig, was insbesondere Nicht-Fachleuten die zweckgerichtete Auswahl des geeigneten Verfahrens erschwert. Dieser Band setzt sich das Ziel, wichtige Optimierungsalgorithmen vorzustellen, damit einem breiteren Interessentenkreis zugänglich zu machen und Praktiker zum Einsatz der Verfahren zu ermutigen.
Jetzt kaufen
Preis: 235,00 €
Preis inkl. MwSt, zzgl. Versand
Euro-Preise für Wiley-VCH- und Ernst & Sohn-Titel sind nur für Deutschland gültig. In EU-Ländern gilt die lokale Mehrwertsteuer. Portokosten werden berechnet.
- Gedruckte Ausgabe vergriffen -
Weitere Versionen
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 presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.
-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)
Heiko Rieger received his PhD in theoretical physics in 1989 at the Universität zu Köln, Germany. From 1990 to 1992, he worked as a postdoc at the University of Maryland at College Park and at the University of California at Santa Cruz. In 1994, he got his habilitation in theoretical physics and was a Heisenberg fellow from 1996 to 1999, working at the Forschungszentrum Jülich. He started teaching as a professor for theoretical physics at the Universität des Saarlandes (Saarbrücken, Germany) in 1999. His main research areas are: statistical physics and computational physics, in particular disordered and glassy systems, non-equilibrium dynamics, stochastic processes, complex systems, Monte Carlo simulations and combinatorial optimization.
