## Hierarchical BOA Solves Ising Spin Glasses and MAXSAT (2003)

### Cached

### Download Links

- [ftp-illigal.ge.uiuc.edu]
- [www.cs.york.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2003), number 2724 in LNCS |

Citations: | 46 - 17 self |

### BibTeX

@INPROCEEDINGS{Pelikan03hierarchicalboa,

author = {Martin Pelikan and Martin Pelikan and David E. Goldberg and David E. Goldberg},

title = {Hierarchical BOA Solves Ising Spin Glasses and MAXSAT},

booktitle = {In Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2003), number 2724 in LNCS},

year = {2003},

pages = {1271--1282},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Theoretical and empirical evidence exists that the hierarchical Bayesian optimization algorithm (hBOA) can solve challenging hierarchical problems and anything easier. This paper applies hBOA to two important classes of real-world problems: Ising spin-glass systems and maximum satis ability (MAXSAT). The paper shows how easy it is to apply hBOA to realworld optimization problems. The results indicate that hBOA is capable of solving enormously dicult problems that cannot be solved by other optimizers and still provide competitive or better performance than problem-speci c approaches on other problems. The results thus con- rm that hBOA is a practical, robust, and scalable technique for solving challenging real-world problems.