New Optimization Algorithms in Physics
Home > Mathematics and Science Textbooks > Physics > New Optimization Algorithms in Physics
New Optimization Algorithms in Physics

New Optimization Algorithms in Physics


     0     
5
4
3
2
1



Available


X
About the Book

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.

Table of 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)

About the Author :
Alexander Hartmann studied computer science and physics at the universities of Hagen, Duisburg and Heidelberg, Germany. After receiving his PhD in 1998, he went as a postdoc first to the University of Göttingen, Germany, then to the University of California at Santa Cruz and the Ecole Normale Superieure, France. In 2002, he returned to the University of Göttingen, where he is currently heading a junior research group. His research interests comprise computer simulations, disordered magnetic systems, surface physics, combinatorial optimization and bioinformatics. 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.

Review :
"This book is recommended for academic libraries, especially those with strong physics collections. It would be useful to faculty in physics, mathematics, and computer science…" (E-STREAMS, February 2005)


Best Sellers


Product Details
  • ISBN-13: 9783527404063
  • Publisher: Wiley-VCH Verlag GmbH
  • Publisher Imprint: Blackwell Verlag GmbH
  • Height: 247 mm
  • No of Pages: 312
  • Spine Width: 20 mm
  • Width: 176 mm
  • ISBN-10: 3527404066
  • Publisher Date: 11 Jun 2004
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Weight: 709 gr

Related Categories

Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
New Optimization Algorithms in Physics
Wiley-VCH Verlag GmbH -
New Optimization Algorithms in Physics
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

New Optimization Algorithms in Physics

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!