Streamlined constraint reasoning

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

Volumn 3258, Issue , 2004, Pages 274-289

  Gomes, Carla ^a   Sellmann, Meinolf ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Branching strategies; Constraint reasoning; Search

Indexed keywords

CONSTRAINT THEORY;

BRANCHING STRATEGIES; COMBINATORIAL DESIGN; CONSTRAINT REASONING; NEW APPROACHES; PROBLEM INSTANCES; SEARCH; SOLUTION SPACE;

COMPUTER PROGRAMMING;

EID: 33750352882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_22     Document Type: Article

References (18)

1. R.K. Ahuja, T.L. Magnati, and J.B. Orlin. Network Flows. Prentice Hall, 1993.
2. K. R. Apt. The Rough Guide to Constraint Propagation. 5th International Conference on Principles and Practice of Constraint Programming (CP), LNCS 1713:1-23, 1999.
3. R.C. Bose, S.S. Shrikhande, and E.T. Parker. Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture. Canadian Journal of Mathematics, 12:189-203, 1960.
4. P. Codognet and D. Diaz. An Efficient Library for Solving CSP with Local Search. http://ws.ailab.sztaki.hu/Codognet_Diaz.pdf.
5. C.J. Colbourn and J.H. Dinitz. (Eds.) The CRC Handbook of Combinatorial Designs, in CRC Press Series on Discrete Mathematics and its Applications, CRC Press, 1996.
6. T. Fahle, S. Schamberger, and M. Sellmann. Symmetry Breaking. 7th International Conference on Principles and Practice of Constraint Programming (CP), LNCS 2239:93-107, 2001.
7. F. Focacci and M. Milano. Global Cut Framework for Removing Symmetries. 7th International Conference on Principles and Practice of Constraint Programming (CP), LNCS 2239:77-92, 2001.
8. F. Focacci and P. Shaw. Pruning sub-optimal search branches using local search. CP-AI-OR, pp. 181-189, 2002.
9. C. Gomes, M. Sellmann, H. van Es, and C. van Es. The Challenge of Generating Spatially Balanced Scientific Experiment Designs. Poster CP-AI-OR, 2004. See also www.cs.cornell.edu/gomes/SBLS.htm.
10. ILOG Solver 5.1. User's manual:443-446, 2001.
11. J. Moran. The Wonders of Magic Squares. New York: Vintage, 1982.
12. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. 12th National Conference on Artificial Intelligence, AAAI, pp. 362-367, 1994.
13. J.K. Rowling. Harry Potter and the Sorcerer's Stone. Scholastic, 1998.
14. G. Tarry. Le problème des 36 officiers. C.R.Assoc. France Av. Science, 29(2):170-203, 1900.
15. W. Trump. How many magic squares are there? Found at http://www.trump.de/magic-squares/howmany.html, 2003.
16. 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.
17. B. Hnich, B.M. Smith, and T. Walsh. Dual Modelling of Permutation and Injection Problems. Journal of Artificial Intelligence Research, 21:357-391, 2004
18. E.W. Weisstein. Magic Square. From Mathworld - A Wolfram Web Resource. http://mathworld.worlfram.com/MagicSquare.html, 1999.