The challenge of generating spatially balanced scientific experiment designs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3011, Issue , 2004, Pages 387-394

  Gomes, Carla ^a   Sellmann, Meinolf ^a   Van Es, Cindy ^a   Van Es, Harold ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048829796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_28     Document Type: Article

References (16)

1. A. Anagnostopoulos, L. Michel, P. van Hentenryck, and Y. Vergados. A Simulated Annealing Approach to the Traveling Tournament Problem. In Proc. CPAIOR'03, 2003.
2. A. Atkinson and R. Bailey. One hundred years of design of expriements on and off the pages of biometrika. Biometrika, 88:53-97, 2001.
3. R. Bose and S. Shrikhande. On the falsity of euler's conjecture about the nonexistence of two orthogonal latin squares of order 4t+2. In Proc. Nat. Ac. of Sc. 45. 1959.
4. W. Cochran and G. Cox. Experimental design. John Wiley and Sons, Inc., 1950.
5. T. Fahle, S. Schamberger, and M. Sellmann. Symmetry Breaking. In Principles and practice of Constraint Programming (CP01) Lecture Notes in Computer Science, pages 93-107. Springer-Verlag, 2001.
6. F. Focacci and M. Milano. Global Cut Framework for Removing Symmetries. In Principles and practice of Constraint Programming (CP01) Lecture Notes in Computer Science, pages 77-92. Springer-Verlag, 2001.
7. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
8. C. P. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning, 24(1-2):67-100, 2000.
9. W. Harvey. Symmetry Breaking and the Social Golfer Problem. In Proc. SymCon'01, 2001.
10. B. Hnich, B. M. Smith, and T. Walsh. Dual modelling of permutation and injection problems. 2003.
11. J. Regin. A Filtering Algorithm for Constraints of Difference in CSPs. In Proc. of AAAI, pages 362-367, 1994.
12. I. J. D. Rodriguez, A. del Val, and M. CebriĀín. Redundant Modeling for the QUasigroup Completion Problem. In F. Rossi, editor, Principles and practice of Constraint Programming (CP03) Lecture Notes in Computer Science, pages 288-302. Springer-Verlag, 2003.
13. B. Smith. Reducing Symmetry in a Combinatorial Design Problem. In Proc. CPAIOR'01, pages 351-360, 2001.
14. H. van Es. Sources of soil variability. In Methods of Soil Analysis, Part 4: Physical Properties. Soil Sci. Soc. Am, 2002.
15. H. van Es and C. van Es. The spatial nature of randomization and its effects on outcome of field experiments. Agron. J., (85):420-428, 1993.
16. H. Zhang. Specifying latin square problems in propositional logic. In Automated Reasoning and Its Applications. MIT Press, 1997.