Home > Research > Publications & Outputs > Erratum

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130)

Research output: Contribution to Journal/Magazine › Comment/debate › peer-review

Published

Standard

Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130). / Kheiri, Ahmed; Ozcan, Ender.
In: Computer Journal, Vol. 58, No. 8, 01.01.2015, p. 1857.

Research output: Contribution to Journal/Magazine › Comment/debate › peer-review

Harvard

Kheiri, A & Ozcan, E 2015, 'Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130)', Computer Journal, vol. 58, no. 8, pp. 1857. https://doi.org/10.1093/comjnl/bxv044

APA

Kheiri, A., & Ozcan, E. (2015). Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130). Computer Journal, 58(8), 1857. https://doi.org/10.1093/comjnl/bxv044

Vancouver

Kheiri A, Ozcan E. Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130). Computer Journal. 2015 Jan 1;58(8):1857. doi: 10.1093/comjnl/bxv044

Author

Kheiri, Ahmed ; Ozcan, Ender. / Erratum : Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130). In: Computer Journal. 2015 ; Vol. 58, No. 8. pp. 1857.

Bibtex

@article{359e876b03aa425ca70b767c76d95a0a,
title = "Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130)",
abstract = "doi:10.1093/comjnl/bxt130Comp J 2014;57(3): 469–479Descriptions of LLH3 and LLH9 are amended as follows:LLH3: Select largest sum(or close to largest) of row, column or diagonal and smallest sum (or close to smallest) of row, column or diagonal and swap the largest element from the first with smallest in the second.LLH9: Select the row with the largest sum(or close to largest) and another rowwith the lowest sum(or close to smallest) and swap each entry with a probability of 0.5. Then, do the same for columns.The authors apologise for this error.{\textcopyright} The British Computer Society 2015. All rights reserved",
author = "Ahmed Kheiri and Ender Ozcan",
year = "2015",
month = jan,
day = "1",
doi = "10.1093/comjnl/bxv044",
language = "English",
volume = "58",
pages = "1857",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "8",

}

RIS

TY - JOUR

T1 - Erratum

T2 - Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130)

AU - Kheiri, Ahmed

AU - Ozcan, Ender

PY - 2015/1/1

Y1 - 2015/1/1

N2 - doi:10.1093/comjnl/bxt130Comp J 2014;57(3): 469–479Descriptions of LLH3 and LLH9 are amended as follows:LLH3: Select largest sum(or close to largest) of row, column or diagonal and smallest sum (or close to smallest) of row, column or diagonal and swap the largest element from the first with smallest in the second.LLH9: Select the row with the largest sum(or close to largest) and another rowwith the lowest sum(or close to smallest) and swap each entry with a probability of 0.5. Then, do the same for columns.The authors apologise for this error.© The British Computer Society 2015. All rights reserved

AB - doi:10.1093/comjnl/bxt130Comp J 2014;57(3): 469–479Descriptions of LLH3 and LLH9 are amended as follows:LLH3: Select largest sum(or close to largest) of row, column or diagonal and smallest sum (or close to smallest) of row, column or diagonal and swap the largest element from the first with smallest in the second.LLH9: Select the row with the largest sum(or close to largest) and another rowwith the lowest sum(or close to smallest) and swap each entry with a probability of 0.5. Then, do the same for columns.The authors apologise for this error.© The British Computer Society 2015. All rights reserved

U2 - 10.1093/comjnl/bxv044

DO - 10.1093/comjnl/bxv044

M3 - Comment/debate

AN - SCOPUS:84938832870

VL - 58

SP - 1857

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 8

ER -