Phase diagram for the constrained integer partitioning problem

Random Structures and Algorithms

Volumn 24, Issue 3, 2004, Pages 315-380

  Borgs, C ^a   Chayes, J T ^a   Mertens, S ^b   Pittel, B ^c  

^a MICROSOFT RESEARCH   (United States)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11144303514     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20001     Document Type: Article

References (19)

1. See http://tina.nat.uni-magdeburg.de for a description of the 156 cpu selfmade parallel computer TINA.
2. H. Bauke, TRNG-a portable random number generator for parallel computing, http://tina.nat.uni-magdeburg.de/TRNG.
3. C. Borgs, J. T. Chayes, and B. Pittel, Phase transition and finite-size scaling for the integer partitioning problem, Random Structures Algorithms 19 (2001), 247-288.
4. C. Borgs, J. T. Chayes, and B. Pittel, Sharp threshold and scaling window for the integer partitioning problem, Proc 33rd ACM Symp Theory of Computing, 2001, pp. 330-336.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, The MIT Electrical Engineering and Computer Science Series, MIT Press, Cambridge, MA, 1990.
6. B. Derrida, Random-energy model: An exactly solvable model of disordered systems, Phys Rev B 3 24 (1981), 2613-2626.
7. F. F. Ferreira and J. F. Fontanari, Probabilistic analysis of the number partitioning problem, J Phys A 31 (1998), 3417-3428.
8. F. F. Ferreira and J. F. Fontanari, Statistical mechanics analysis of the continuous number partitioning problem, Physica A 269 (1999), 54-60.
9. Y. Fu, "The use and abuse of statistical mechanics in computational complexity," Lectures in the Science of Complexity; Proceedings of the 1988 Complex Systems Summer School, Santa Fe, New Mexico, 1988, Ed. D. L. Stein. Addison-Wesley, Reading, MA, 1989, 815-826.
10. I. P. Gent and T. Walsh, "Phase transitions and annealed theories: Number partitioning as a case study," W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence, Budapest, 170-174. Wiley, New York, 1996.
11. G. R. Grimmett and D. R. Stirzaker, Probability and random processes, Oxford University Press, Oxford, 1992.
12. B. Hayes, The easiest hard problem, Amer Scientist 90 (2002), 113-117.
13. E. Horowitz and S. Sahni, Computing partitions with applications to the Knapsack problem, J ACM 21(2) (1974), 277-292.
14. N. Karmarkar and R. M. Karp, The differencing method of set partitioning, Technical Report UCB/CSD 82/113, Computer Science Division (EECS), University of California, Berkeley, 1982.
15. N. Karmarkar, R. M. Karp, G. S. Lueker, and A. M. Odlyzko, Probabilistic analysis of optimum partitioning, J Appl Probab 23 (1986), 626-645.
16. G. S. Lueker, Exponentially small bounds on the expected optimum of the partition and subset sum problem, Random Structures Algorithms 12 (1998), 51-62.
17. S. Mertens, Phase transition in the number partitioning problem, Phys Rev Lett 81 (1998), 4281-4284.
18. S. Mertens, Random costs in combinatorial optimization, Phys Rev Lett 84 (2000), 1347-1350.
19. B. Yakir, The differencing algorithm LDM for partitioning; a proof of a conjecture of Karmakar and Karp, Math Oper Res 21 (1996), 85-99.