1. R.M. Aiex, Asynchronous Parallel Tabu Search Strategies with an Application to Graph Partitioning (in Portuguese), M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 1996.
2. A.A. Andreatta and C.C. Ribeiro, “A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits”, Annals of Operations Research 50 (1994), 1–36.
3. E.C. Archambeau and E.J. Mccluskey, “Fault Coverage of Pseudo-Exhaustive Testing”, Digest of Papers of the 14th International Conference on Fault-Tolerant Computing, 141–145, IEEE, 1984.
4. P. Badeau, F. Guertin, J.-Y. Potvin, M.Gendreau, and E.D. Taillard, “A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows”, Transportation Research C 5 (1997), 109–122.
5. F. Berglez and H. Fujiwara, “A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran”, Special session on “ATPG and Fault Simulation”, IEEE International Symposium on Circuits and Systems, Kyoto, 1985.