REFERENCES
- P. J. Cameron and J. H. van Lint, Graph Theory, Coding Theory and Block Designs, London Mathematical Society Lecture Note Series 19, Cambridge University Press, Cambridge, MA, 1975.
- G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
- R. A. Fisher, The arrangement of field experiments, J. Minist. Agric. 33 (1926), 503–513.
- M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman and Co., New York, 1979.
- Haim Hanani, The existence and construction of balanced incomplete block designs, Ann. Math. Statist. 32 (1961).
- J. J. Hopfield and D. W. Tank, Computing with neural circuits: a model, Science 4764 (1986), 625–632.
- D. R. Hughes and F. C. Piper, Design Theory, Cambridge University Press, Cambridge, MA, 1985.
- P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications, D. Reidel Publishing Co., Dordrecht, Netherlands, 1987.
- E. L. Lalwer, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, The Traveling Salesman Problem, John Wiley and Sons, Inc., New York, 1985.
- C. H. Papadimitriou and K. Steigfliz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall Inc., Englewood Cliffs, NJ, 1982.
- F. S. Roberts, Applied Combinatorics, Prentice-Hall Inc., Englewood Cliffs, NJ, 1984.
- T. J. Sejnowski and G. E. Hinton, Vision, Brain and Cooperative Computation, MIT Press, Cambridge, MA, 1985.
- A. Tucker, Applied Combinatorics, 2nd edition, John Wiley and Sons, Inc., New York, 1985.
- S. Vajda, The Mathematics of Experimental Design (Incomplete Block Designs and Latin Squares), Hafner Publishing Co., New York, 1967.
- H. M. Wagner, Principles of Operations Research, Prentice-Hall, Englewood Cliffs, NJ, 1975.
- P. H. Winston, Artificial Intelligence, Addison-Wesley Publishing Co., Reading, MA, 1984.