Scheduling Social Golfers Locally

  title={Scheduling Social Golfers Locally},
  author={Iv{\'a}n Dot{\'u} and Pascal Van Hentenryck},
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one of the standard benchmarks for symmetry breaking in constraint programming. This paper presents a very effective, local search, algorithm for scheduling social golfers. The algorithm find the first known solutions to 11 instances and matches, or improves, state-of-the-art results from constraint programming on all but 3… CONTINUE READING
13 Citations
10 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 10 references

Reduction Techniques in Constraint Programming and Combinatorial Optimization

  • M. Sellmann
  • PhD thesis, University of Paderborn,
  • 2003
3 Excerpts

Solving the Social Golfer Using Local Search

  • M. Ågren
  • saps02/MagnusAgren/,
  • 2003
1 Excerpt

Symmetry breaking

  • Schamberger Fahle, Torsten, Stefan, Meinolf Sellmann
  • Principles and Practice of Constraint…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…