Solving kirkman's schoolgirl problem in a few seconds

Constraints

Volumn 10, Issue 1, 2005, Pages 7-21

  Barnier, Nicolas ^a   Brisset, Pascal ^a  

^a ENAC   (France)

Author keywords

Resolvable steiner systems; Social golfer problem; Symmetry breaking

Indexed keywords

ALGORITHMS; BENCHMARKING; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS;

CONSTRAINT PROGRAMMING; RESOLVABLE STEINER SYSTEMS; SOCIAL GOLFER PROBLEMS; SYMMETRY BREAKING;

PROBLEM SOLVING;

EID: 14644403022     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10601-004-5305-9     Document Type: Conference Paper

References (19)

1. Barnier, N., & Brisset, P. (2001). FaCiLe: A functional constraint library. In Proceedings of CICLOPS2001. Paphos, pages 52-66.
2. Cohen, M. B., Colbourn, C. J., Ives, L. A., & Ling, A. C. H. (2001). Kirkman triple systems of order 21 with nontrivial automorphism group. Math. Comput.
3. Walsh, T., ed. (2001). CP'01: 7th International Conference on Principle and Practice of Constraint Programming, number 2239 in LNCS, Springer-Verlag, Paphos, Cyprus.
4. CPAIOR'02: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, Le Croisic, France, 2002.
5. Fahle, T., Schamberger, S., & Sellmann, M. Symmetry breaking. In CP'01 [3], pages 93-107.
6. Focacci, F., & Milano, M. Global cut framework for removing symmetries. In CP'01 [3], pages 77-92.
7. Gent, I., Walsh, T., & Selman, B. CSPlib: A problem library for constraints, csplib.org.
8. Gent, I. P., & Barbara, S. (2000). Symmetry breaking during search in constraint programming. In Horn, W., ed., EACI'2000, pages 599-603.
9. Gervet, C. (1997). Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3): 191-244. www.icparc.ic.ac.uk/~cg6.
10. Gervet, C., & Sadler, A. (2004). Global Filtering for the Disjointness Constraint on Fixed Cardinality Sets. Technical Report, ICPARC-04-02 (March).
11. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2(4): 225-231.
12. Kirkman, T. P. (1850). Note on an unanswered prize question. Cambridge Dublin Math. J. 5: 255-262.
13. Hall, M. Jr. (1983). Combinatorial Theory, 2nd Edition. Wiley Classics Library.
14. McKay, B. D. (1981). Practical graph isomorphism. Congr. Numerantium 30: 45-87.
15. Prestwich, S. Randomised backtracking for linear pseudo-boolean constraint problems. In CPAIOR'02 [4], pages 7-19.
16. Régin, J. -C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of the Thirteenth National Conference on Artificial Intelligence.
17. Sadler, A., & Gervet, C. (2001). Global reasoning on sets. In Formul'01, Workshop Modelling and Problem Formulation.
18. Sellmann, M., & Harvey, W. Heuristic constraint propagation. In CPAIOR'02 [4], pages 191-204.
19. Smith, B. (2001). Reducing symmetry in a combinatorial design problem. In CPAIOR'01, pages 351-359 (April). www.icparc.ic.ac.uk/cpAIOR01.