470,821 Members | 2,068 Online
Bytes | Developer Community
New Post

Home Posts Topics Members FAQ

Post your question to a community of 470,821 developers. It's quick & easy.

Optimization problem, for a sports tournament

JE
Hi all!

I am working on a Perl program for managing a (real-life) sports
tournament. There are 10 teams involved, which all are to play against
every other team exactly once. Thus, each team plays a total of 9 matches.

The tournament is divided into 3 "rounds", each consisting of 15 matches.
All 10 teams are present at each round, and must play exactly 3 of their 9
matches per round. All 15 matches in a round are to be played at one and
the same field, so only one match can be played at a time.

The problem is to create an efficient playing program for each round, so
that the waiting time between any team's matches will be minimized.


Does anyone have a good algorithm for solving such an optimization problem?

Thanks!

- Joakim

--
jo************@nospam.spray.no

Remove nospam to reply!
Jul 19 '05 #1
0 2082

This discussion thread is closed

Replies have been disabled for this discussion.

Similar topics

reply views Thread by Kewlb | last post: by
2 posts views Thread by Krick | last post: by
2 posts views Thread by John Ryan | last post: by
16 posts views Thread by cody | last post: by
1 post views Thread by urvi | last post: by
1 post views Thread by noremy | last post: by
1 post views Thread by Bryan | last post: by
By using this site, you agree to our Privacy Policy and Terms of Use.