Optimization problem, for a sports tournament

Discussion in 'Perl' started by JE, Aug 4, 2004.

  1. JE

    JE Guest

    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

    --


    Remove nospam to reply!
    JE, Aug 4, 2004
    #1
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. steedownes
    Replies:
    4
    Views:
    414
    steve
    Nov 8, 2005
  2. JE
    Replies:
    2
    Views:
    393
    Karl Heinz Buchegger
    Aug 5, 2004
  3. Carl Friedrich Bolz
    Replies:
    0
    Views:
    283
    Carl Friedrich Bolz
    Dec 5, 2006
  4. csgraham74

    Control For Sports Results Tables

    csgraham74, Mar 11, 2007, in forum: ASP .Net
    Replies:
    3
    Views:
    319
    Mark Rae
    Mar 26, 2007
  5. flebber

    Ruby Time - Sports Time

    flebber, Nov 4, 2010, in forum: Ruby
    Replies:
    3
    Views:
    123
    Robert Klemme
    Nov 4, 2010
Loading...

Share This Page