A simulated annealing algorithm is used in the construction of subsquare free Latin squares. The algorithm is described and experience from its application is reported. Results obtained include the construction of subsquare free Latin squares of orders 16 and 18, the smallest orders for which existence of such squares was previously in doubt.

@article{Elliott1992TheCO,
title={The construction of subsquare free Latin squares by simulated annealing},
author={J. R. Elliott and Peter B. Gibbons},
journal={Australasian J. Combinatorics},
year={1992},
volume={5},
pages={209-228}
}