Name
Abstract | ||
|---|---|---|
We generalize the concept of a break by considering pairs of arbitrary rounds. We show that a set of home-away patterns minimizing the number of generalized breaks cannot be found in polynomial time, unless P=NP. When all teams have the same break set, the decision version becomes easy; optimizing remains NP-hard. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.orl.2011.09.001 | Operations Research Letters |
Keywords | Field | DocType |
Sport scheduling,Home-away patterns,Breaks,Nonconsecutive rounds,Complexity | Combinatorics,Upper and lower bounds,Scheduling (computing),Generalization,Time complexity,Mathematics,Special case | Journal |
Volume | Issue | ISSN |
39 | 6 | 0167-6377 |
Citations | PageRank | References |
2 | 0.41 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dries R. Goossens | 1 | 129 | 15.88 |
| Frits C. R. Spieksma | 2 | 591 | 58.84 |