1. Angelopoulos, P., Evangeleras, H., Koukouvinos, C., Lappas, E., 2007. A powerful step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays, Metrika, to appear.
2. Appa, G., Mourtos, I., Magos, D., 2002. Integrating constraint and integer programming for the orthogonal Latin squares problem. In: Van Hentenryck, P. (Ed.), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 2470. Springer, Berlin, pp. 17–32.
3. A branch & cut algorithm for a for a four-index assignment problem;Appa;J. Oper. Res. Soc.,2004
4. A note on some computationally difficult set covering problems;Avis;Math. Programming,1980
5. Bulutoglu, D.A., Ryan, K.J., 2007. D-optimal and near D-optimal 2k fractional factorial designs of resolution V. J. Statist. Plann. Inference, accepted for publication.