Ponente
Eduardo Piza
(CIMPA, Universidad de Costa Rica)
Descripción
We introduce the balanced incomplete block designs (BIBDs) and some
algorithms to generate them. The BIBDs have their origin in practical
applications in experimental designs in agronomy. They also
have deep theoretical applications in the field of non-Euclidean geometry, as well as in the field of combinatorics, since they can be used, among other things, for the construction of finite projective planes, finite affine planes, and Hadamard matrices of special orders. In this article, we use simulated annealing algorithms to find BIBDs. We compare the results obtained against the results of researchers who have used other classical heuristic methods. Our algorithms far outperform all other heuristic methods previously employed.
Autores primarios
Eduardo Piza
(CIMPA, Universidad de Costa Rica)
Prof.
Esteban Segura
(CIMPA, Universidad de Costa Rica)
