Analysis of heuristics for number partitioning

Computational Intelligence

Volumn 14, Issue 3, 1998, Pages 430-451

  Gent, Ian P ^a   Walsh, Toby ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Heuristics; Number partitioning; Phase transitions

Indexed keywords

ALGORITHMS; NUMBER THEORY; PROBLEM SOLVING;

NUMBER PARTITIONING;

HEURISTIC METHODS;

EID: 0032142374     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00069     Document Type: Article

References (22)

1. BARBER, M. N. 1983. Finite-size scaling. In Phase Transitions and Critical Phenomena, vol. 8. Academic Press, London, pp. 145-266.
2. CHEESEMAN, P., B. KANEFSKY, and W. TAYLOR. 1991. Where the really hard problems are. In Proceedings of the 12th IJCAI, 331-337. International Joint Conference on Artificial Intelligence, pp. 331-337.
3. CHVATAL, V., and B. REED. 1992. Mick gets some (the odds are on his side). In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. IEEE, pp. 620-627.
4. FU, Y. 1989. The uses and abuses of statistical mechanics in computational complexity. In Lectures in the Sciences of Complexity. Edited by D. Stein. Addison-Wesley Longman, Reading, MA, pp. 815-826.
5. GAREY, M. R., and D. S. JOHNSON. 1979. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, San Francisco.
6. GENT, I., E. MACINTYRE, P. PROSSER, B. M. SMITH, and T. WALSH. 1996. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Proceedings of CP-96. Springer-Verlag, Berlin, pp. 179-193.
7. GENT, I., E. MACINTYRE, P. PROSSER, and T. WALSH. 1995. Scaling effects in the CSP phase transition. In 1st International Conference on Principles and Practices of Constraint Programming (CP-95). Springer-Verlag, Berlin, pp. 70-87.
8. GENT, I., E. MACINTYRE, P. PROSSER, and T. WALSH. 1996. The constrainedness of search. In Proceedings of AAAI-96, pp. 246-252.
9. GENT, I. P., and T. WALSH. 1994. The hardest random SAT problems. In KI-94: Advances in Artificial Intelligence, 18th German Annual Conference on Artificial Intelligence. Edited by B. Nebel and L. Dreschler-Fischer. Springer-Verlag, Berlin, pp. 355-366.
10. GENT, I., and T. WALSH. 1996a. Phase transitions and annealed theories: Number partitioning as a case study. In Proceedings of ECAI-96, pp. 170-174.
11. GENT, I., and T. WALSH, 1996b. The TSP phase transition. Artificial Intelligence, 88, 349-358.
12. HOGG, T. 1995. Exploiting problem structure as a search heuristic Technical report, Dynamics of Computation Group, Xerox Palo Alto Research Center. PARC Preprint, ftp://parcftp.xerox.com/pub/dynamics/ con straints.html.
13. KARMARKAR, N., and R. KARP. 1982. The differencing method of set partitioning. Technical report UCB/CSD/82-114, Computer Science Division, University of California, Berkeley, California.
14. KARMARKAR, N., R. KARP, J. LUEKER, and A. ODLYZKO. 1986. Probabilistic analysis of optimum partitioning, Journal of Applied Probability, 23:626-645.
15. KIRKPATRICK, S., and B. SELMAN. 1994. Criticial behaviour in the satisfiability of random boolean expressions. Science, 264:1297-1301.
16. KORF, R. 1995. From approximate to optimal solutions: A case study of number partitioning. In Proceedings of the 14th IJCAI. International Joint Conference on Artificial Intelligence, pp. 266-272.
17. MITCHELL, D., B. SELMAN, and H. LEVESQUE. 1992. Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference on AI. American Association for Artificial Intelligence, pp. 459-465.
18. PEMBERTON, J., and W. ZHANG. 1996. Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems. Artificial Intelligence, 81:297-325.
19. RUML, W., J. NGO, J. MARKS, and S. SHIEBER. 1994. Easily searched encodings for number partitioning. Technical report TR-10-94, Center for Research in Computing Technology, Harvard University.
20. SELMAN, B., and S. KIRKPATRICK. 1996. Critical behavior in the computational cost of satisfiability testing. Artificial Intelligence, 81(1-2):273-296.
21. SMITH, B., and M. DYER. 1996. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181.
22. WILLIAMS, C., and T. HOGG. 1994. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117.