Abstract
The development of the theory and construction of combinatorial designs originated with the work of Euler on Latin squares. A Latin square on n symbols is an n × n matrix (n is the order of the Latin square), in which each symbol occurs precisely once in each row and in each column. Several interesting research questions posed by Euler with respect to Latin squares, namely regarding orthogonality properties, were only solved in 1959 [3]. Many other questions concerning Latin squares constructions still remain open today.
This research was partially supported by AFOSR grants F49620-01-1-0076 (Intelligent Information Systems Institute) and F49620-01-1-0361 (MURI).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anagnostopoulos, A., Michel, L., van Hentenryck, P., Vergados, Y.: A Simulated Annealing Approach to the Traveling Tournament Problem. In: Proc. CPAIOR 2003 (2003)
Atkinson, A., Bailey, R.: One hundred years of design of expriements on and off the pages of biometrika. Biometrika 88, 53–97 (2001)
Bose, R., Shrikhande, S.: On the falsity of euler’s conjecture about the nonexistence of two orthogonal latin squares of order 4t+2. Proc. Nat. Ac. of Sc. 45 (1959)
Cochran, W., Cox, G.: Experimental design. John Wiley and Sons, Inc., Chichester (1950)
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry Breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)
Focacci, F., Milano, M.: Global Cut Framework for Removing Symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77–92. Springer, Heidelberg (2001)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning 24(1-2), 67–100 (2000)
Harvey, W.: Symmetry Breaking and the Social Golfer Problem. In: Proc. Sym-Con 2001 (2001)
Hnich, B., Smith, B.M., Walsh, T.: Dual modelling of permutation and injection problems (2003)
Regin, J.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proc. of AAAI, pp. 362–367 (1994)
Rodriguez, J.D., del Val, A., CebriÃín, M.: Redundant Modeling for the QUasigroup Completion Problem. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 288–302. Springer, Heidelberg (2003)
Smith, B.: Reducing Symmetry in a Combinatorial Design Problem. In: Proc. CPAIOR 2001, pp. 351–360 (2001)
van Es, H.: Sources of soil variability. In: Methods of Soil Analysis, Part 4: Physical Properties. Soil Sci. Soc. Am. (2002)
van Es, H., van Es, C.: The spatial nature of randomization and its effects on outcome of field experiments. Agron. J. (85), 420–428 (1993)
Zhang, H.: Specifying latin square problems in propositional logic. In: Automated Reasoning and Its Applications, MIT Press, Cambridge (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gomes, C., Sellmann, M., van Es, C., van Es, H. (2004). The Challenge of Generating Spatially Balanced Scientific Experiment Designs. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive