Jump to ContentJump to Main Navigation
Information, Physics, and Computation$
Users without a subscription are not able to see the full content.

Marc Mézard and Andrea Montanari

Print publication date: 2009

Print ISBN-13: 9780198570837

Published to Oxford Scholarship Online: September 2009

DOI: 10.1093/acprof:oso/9780198570837.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 30 March 2020

Number partitioning

Number partitioning

Chapter:
(p.131) 7 Number partitioning
Source:
Information, Physics, and Computation
Author(s):

Marc Mézard

Andrea Montanari

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198570837.003.0007

Number partitioning is one of the most basic optimization problems. It is very easy to state: ‘Given the values of N assets, is there a fair partition of them into two sets?’ Nevertheless, it is very difficult to solve: it belongs to the NP-complete category, and the known heuristics are often not very good. It is also a problem with practical applications, for instance in multiprocessor scheduling. This chapter focuses on a particularly difficult case: the partitioning of a list of independent uniformly distributed random numbers. It discusses the phase transition occurring when the range of numbers varies, and shows that low cost configurations — the ones with a small unbalance between the two sets — can be seen as independent energy levels. Hence the model behaves analogously to the Random Energy Model.

Keywords:   number partitioning, phase transition, random numbers, Random Energy Model, NP-complete category, low cost configurations

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 .