Constraint Technology (course 1DL023) Uppsala University – Autumn 2009 Project Portfolio

2. The project is to be done individually. Take our warning on plagiarism very seriously. We assume that by submitting a solution you are certifying that it is solely your work, except where explicitly stated otherwise, and that you can explain any part of the solution. 3. Specify the operating system, CPU, CPU speed, and cache size of the chosen computer. 4. Document your program by instructions on how to compile and run it, as well as sample test-run commands with inputs and outputs. (Check whether these test runs are reproducible by the program you submit.) If your program has this documentation, compiles without error under version 3.1.0 of Gecode, and produces correct outputs on our computer, then you get 6 points, otherwise you get 0 (zero) points. 5. Give a pseudocode annotated with English paraphrases of the problem constraints, chan-nelling constraints, implied constraints, symmetry-breaking constraints, branching heuris-tics, search order, etc, plus an English description of the semantics and domains of the decision variables, redundant decision variables, and instance variables. (8 points) 6. Experimentally validate the positive impact of any redundant decision variables, channelling constraints, implied constraints, and symmetry-breaking techniques. (3 points