prob009: perfect square placement

proposed by

References

[AB93] A. Aggoun, N. Beldiceanu. Extending CHIP in Order to Solve Complex Scheduling Problems. Journal of Mathematical and Computer Modelling, Vol. 17, No. 7, pages 57 -73, Pergamon Press, 1993.

[BC 94] N. Beldiceanu, E. Contejean. Introducing Global Constraints in CHIP. Journal of Mathematical and Computer Modelling, Vol 20, No 12, pp 97-123, 1994.

[BD92] C.J. Bouwkamp and A.J.W. Duijvestijn. Catalogue of Simple Perfect Squared Squares of orders 21 through 25. Eindhoven University of Technology, Department of Mathematics nd Computer Science, Technical Report 92 WSK 03 Eindhoven, The Netherlands, November 1992.

[CFG91] H. T. Croft, K.J. Falconer, R.K. Guy. Unsolved Problems in Geometry. Springer-Verlag, New York, Berlin, 1991.

[Dui78] A.J.W. Duijvestijn. Simple Perfect Squared Square of Lowest Order. Journal of Combinatorial Theory, Series B 25, 555-558, 1978

[LW92] J. H. van Lint, R.M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992

[VH94] P. Van Hentenryck. Scheduling and Packing in the Constraint Language cc(FD), in M. Zweben, M. Fox: Intelligent Scheduling Morgan Kaufmann Publishers, San Francisco, USA, 1994.

Back