Jump to ContentJump to Main Navigation
Statistical Physics of Spin Glasses and Information ProcessingAn Introduction$
Users without a subscription are not able to see the full content.

Hidetoshi Nishimori

Print publication date: 2001

Print ISBN-13: 9780198509417

Published to Oxford Scholarship Online: January 2010

DOI: 10.1093/acprof:oso/9780198509417.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 16 January 2021

Optimization Problems

Optimization Problems

(p.183) 9 Optimization Problems
Statistical Physics of Spin Glasses and Information Processing

Hidetoshi Nishimori

Oxford University Press

A decision-making problem is often formulated as the minimization or maximization of a multivariable function, an optimization problem. This chapter shows that the methods of statistical mechanics are useful to study some types of optimization problems including the number partitioning, the graph partitioning, the knapsack problem, and the satisfiability problem. All these problems are shown to be formulated and solved using the theory of spin glasses, in particular the replica method. Then, discussions are continued on the mathematical properties of simulated annealing, an approximate numerical method for generic optimization problems.

Keywords:   optimization problem, cost function, replica method, satisfiability problem, number partitioning, simulated annealing

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .