Analysis of Heuristics for Number Partitioning

@article{Gent1998AnalysisOH,
  title={Analysis of Heuristics for Number Partitioning},
  author={Ian P. Gent and Toby Walsh},
  journal={Computational Intelligence},
  year={1998},
  volume={14},
  pages={430-451}
}
We illustrate the use of phase transition behavior in the study of heuristics. Using an “annealed” theory, we define a parameter that measures the “constrainedness” of an ensemble of number partitioning problems. We identify a phase transition at a critical value of constrainedness. We then show that constrainedness can be used to analyze and compare algorithms and heuristics for number partitioning in a precise and quantitative manner. For example, we demonstrate that on uniform random… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Easily searched encodings for number partitioning

W. RUML, J. NGO, J. MARKS, S. SHIEBER.
Technical report TR-10-94, Center for Research in Computing Technology, Harvard University. • 1994
View 4 Excerpts
Highly Influenced

Probabilistic analysis of optimum partitioning

N. KARMARKAR, R. KARP, J. LUEKER, A. ODLYZKO.
Journal of Applied Probability, • 1986
View 4 Excerpts
Highly Influenced

The differencing method of set partitioning

N. KARMARKAR, R. KARP.
Technical report UCB/CSD/82114, Computer Science Division, University of California, Berkeley, California. • 1982
View 7 Excerpts
Highly Influenced

Principles and Practice of Constraint Programming — CP '95

Lecture Notes in Computer Science • 1995

Similar Papers

Loading similar papers…