By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
438,779 Members | 1,122 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 438,779 IT Pros & Developers. It's quick & easy.

Optimization problem, for a sports tournament

P: n/a
JE
Hi all!

I am working on a Java 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?

- Joakim

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

Remove nospam to reply!
Jul 17 '05 #1
Share this Question
Share on Google+
2 Replies


P: n/a
> Does anyone have a good algorithm for solving such an optimization problem?

- Joakim

no, i havent seen one yet.
i usually just work these things out on a sheet of paper.
- nate

Jul 17 '05 #2

P: n/a
JE
no, i havent seen one yet.
i usually just work these things out on a sheet of paper.

Hi Nate!

Oh, we've tried... And should work too, given enough time and resources.

I'd like to write an all-purpose program for the sports organization,
which will save a lot of time.

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

Remove nospam to reply!
Jul 17 '05 #3

This discussion thread is closed

Replies have been disabled for this discussion.