Traveling tournament problem

The traveling tournament problem (TTP) is an mathematical optimization problem that has been widely studied. The problem is to schedule a series of…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

The Travelling Tournament Problem (TTP) is a NP-hard problem that abstracts the features of certain types of sports scheduling…

2013

The Traveling Tournament Problem (TTP) is a well-known NP-complete problem in sports scheduling that was inspired by the…

2012

The problem of finding optimal schedules for professional sports leagues has attracted interests of many researchers in recent…

2010

The Traveling Tournament Problem (TTP) is a challenging combinatorial optimization problem that has attracted the interest of…

2009

Sports scheduling is a very attractive application area not only because of the interesting mathematical structures of the…

2009

Sports league scheduling problems have gained considerable amount of attention in recent years due to its huge applications and…

2007

Optimization insportsisa field ofincreasing interest. Thetraveling tournament problemabstracts certain characteristics ofsports…

2006

As professional sports have become big businesses all over the world, many researches with respect to sports scheduling problem…

2005

A partial rescheduling (PR) heuristic is presented for single machine with unforeseen breakdowns. Unlike a full rescheduling…

2003

Automating the scheduling of sport leagues has received considerable attention in recent years. This paper considers the…