# A Factorized Distribution Algorithm of bounded complexity for integer problems

**Download:**
PostScript.

“A Factorized Distribution Algorithm of bounded complexity for
integer problems”
by
R. Santana,
A. Ochoa,
and
M. R. Soto,
Institute of Cybernetics.
Mathematics and Physics technical report ICIMAF 2000-, CENIA 2000-,
(Havana, Cuba), Dec. 2000.

## Abstract

A Factorized Distribution algorithm that use up to pairwise dependencies
for the optimization of integer problems is introduced. Our proposal
combines classical methods for structural learning of dependencies with a
procedure that approximates the bivariate marginals by sampling the data
using auxiliary tables. The algorithm overperforms the Univariate Marginal
Distribution Algorithm for the integer problems tested.

**Download:**
PostScript.

**BibTeX entry:**

@techreport{Santana_et_al:2000a,
author = {R. Santana and A. Ochoa and M. R. Soto},
title = {A {F}actorized {D}istribution {Al}gorithm of bounded
complexity for integer problems},
institution = {Institute of Cybernetics, Mathematics and Physics},
number = {ICIMAF 2000-, CENIA 2000-},
address = {Havana, Cuba},
month = dec,
year = {2000},
issn = {0138-8916}
}

(This webpage was created with
bibtex2web.)

Back to Roberto Santana publications.