1. S. Bauman, The existence of balanced tournament designs and partitioned balanced tournament designs, Master Thesis of Mathematics in Combinatorics and Optimization, University of Waterloo, Ont., Canada, Available from: 〈http://etd.uwaterloo.ca/etd/sbbauman2001.pdf〉, 2001.
2. Solving combinatorial problems with regular local search algorithms;Béjar,1999
3. Solving the round robin problem using propositional logic;Béjar,2000
4. C. Colbourn, J. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, Discrete Mathematics and its Applications, vol. 4, CRC Press, Boca Raton, FL, USA, 1996.
5. An evolutionary tabu search algorithm and the NHL scheduling problem;Costa;INFOR,1995