2019-06-132019-06-132018Álvarez Solano, V., Armario Sampalo, J.A., Falcón Ganfornina, R.M., Frau García, M.D., Gudiel Rodríguez, F., Güemes Alzaga, M.B. y Osuna Lucena, A. (2018). A Mixed Heuristic for Generating Cocyclic Hadamard Matrices. Mathematics in Computer Science, 12 (4), 407-417.1661-8270https://hdl.handle.net/11441/87396A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion of fitness, and a peculiar local search, defined as a constraint satisfaction problem. Calculations support the idea that finding a cocyclic Hadamard matrix of order 4 · 47 might be within reach, for the first time, progressing further upon the ideas explained in this work.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Hadamard matricesCocyclic matricesHeuristicConstraint satisfaction probleminfo:eu-repo/semantics/articleinfo:eu-repo/semantics/embargoedAccess10.1007/s11786-018-0377-x