2
$\begingroup$

i have 30 girls who are going to meet 12 guys (out of 30) each in one hour. the girls stay at their table (for example: table #1 for girl #1).

the guys fill up bids and a schedule is formed with this specification:

spot   girl1    girl2     .. 8:00   guy #3   guy #3 8:05   guy #5   guy #1 8:10   guy #6   guy #9 8:15   guy #8   guy #8 8:20   guy #21  guy #7 8:25   guy #4   guy #6 8:30   guy #55  guy #4 8:45   guy #3   guy #2 8:50   guy #24  guy #21 8:55   guy #4   guy #5 

how can i sort the 30 guys in a way no one would have to be at two places at the same time? any algorithm?

UPDATE:

the guys fill up the bids. they have 100 points and can spread them around the 30 girls. the top 12 guys for each girl meet with the girl.

BTW i have a hunch this is a soduko style problem

  • 0
    you're right. sorry. fixed that.2012-12-18

1 Answers 1

1

Arrange the tables in a circle. Start with guy #n opposite girl #n. Then every 5 minutes, the guys move one position clockwise.