Scheduling social golfers locally

Lecture Notes in Computer Science

Volumn 3524, Issue , 2005, Pages 155-167

  Dotú, Iván ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

CONSTRAINT PROGRAMMING; SCHEDULING APPLICATION; SOCIAL GOLFERS;

LINEAR PROGRAMMING;

EID: 26444552167     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_13     Document Type: Conference Paper

References (12)

1. M. Ågren. Solving the Social Golfer Using Local Search, peg.it.uu.se/saps02/MagnusAgren/, 2003.
2. N. Barnier and P. Brisset. Solving kirkman's schoolgirl problem in a few seconds. Constraints, 2005. To appear in the Special Issue on CP'02.
3. C. Colboum and Dinitz. The CRC Handbook of Combinatorial Design. CRC Press, Boca Raton, FL, 1996.
4. C.J. Colbourn and J.H. Dinitz. Mutually orthogonal latin squares: A brief survey of constructions. "Journal of Statistical Planning and Inference", 95:9-48, 2001.
5. T. Fahle, S. Schamberger, and M. Sellmann. Symmetry breaking. In Toby Walsh, editor, Principles and Practice of Constraint Programmingo, volume 2293 of LNCS, pages 93-107. Springer Verlag, 2001.
6. S. Prestwich. Randomized backtracing for linear pseudo-boolean constraint problems. In Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'02), pages 7-19, Le Croisic, France, March 2002.
7. S.D. Prestwich. Supersymmetric Modeling for Local Search. In Second International Workshop on Symmetry in Constraint Satisfaction Problems, 2002.
8. S.D. Prestwich. Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research, 118:137-150, 2003.
9. J.F. Puget. Symmetry breaking revisited. Constraints, 2005. To appear in the Special Issue on CP'02.
10. M. Sellmann. Reduction Techniques in Constraint Programming and Combinatorial Optimization. PhD thesis, University of Paderborn, Germany, 2003.
11. Meinolf Sellmann and Warwick Harvey. Heuristic constraint propagation - Using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem. In Narendra Jussien and François Laburthe, editors, Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'02), pages 191-204, Le Croisic, France, March 2002.
12. B. Smith. Reducing Symmetry in a Combinatorial Design Problem. In CP-AI-OR'2001, pages 351-359, Wye College (Imperial College), Ashford, Kent UK, April 2001.