A branch and bound algorithm for ternary covering arrays construction using trinomial coefficients
Document title: A branch and bound algorithm for ternary covering arrays construction using trinomial coefficients
Journal: Research on computing science
Database: PERIÓDICA
System number: 000341071
ISSN: 1665-9899
Authors: 1
1
Institutions: 1Instituto Politécnico Nacional, Centro de Investigación y de Estudios Avanzados, Ciudad Victoria, Tamaulipas. México
Year:
Volumen: 49
Pages: 61-71
Country: México
Language: Inglés
Document type: Artículo
Approach: Experimental, aplicado
Disciplines: Ciencias de la computación
Keyword: Matemáticas aplicadas,
Software,
Covering arrays,
Diseño de experimentos,
Algoritmos,
Coeficientes trinomiales
Keyword: Computer science,
Applied mathematics,
Software,
Covering arrays,
Experiment design,
Algorithms,
Trinomial coefficients
Document request
Note: The document is shipping cost.









Original documents can be consulted at the Departamento de Información y Servicios Documentales, located in the Annex to the General Directorate of Libraries (DGB), circuito de la Investigación Científica across from the Auditorium Nabor Carrillo, located between the Institutes of Physics and Astronomy. Ciudad Universitaria UNAM. Show map
For more information: Departamento de Información y Servicios Documentales, Tels. (5255) 5622-3960, 5622-3964. E-mail: sinfo@dgb.unam.mx . Monday to Friday from (8 to 16 hrs).