Aurora Hiveley, Rutgers University

Abstract

There are 32 golfers who play golf in groups of 4 once a week. We want to create a schedule for these golfers such that no two golfers play in the same group more than once. How many weeks can we schedule these golfers for? There are a number of similar optimization problems in combinatorics and design theory (for example Kirkman's schoolgirl problem), but these are often computationally challenging. This talk will give a bird's eye view of a number of similar scheduling problems, discussing what is known about each and what open questions still remain.

See: https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html