Scheduling sports tournaments on a single court minimizing waiting times
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Knust, Sigrid | |
dc.date.accessioned | 2021-12-23T15:58:43Z | - |
dc.date.available | 2021-12-23T15:58:43Z | - |
dc.date.issued | 2008 | |
dc.identifier.issn | 01676377 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3523 | - |
dc.description.abstract | We consider a sports tournament for an odd number of teams where every team plays exactly two matches in each round and all matches have to be scheduled consecutively on a single court. We construct schedules for any number of teams minimizing waiting times. (C) 2008 Elsevier B.V. All rights reserved. | |
dc.language.iso | en | |
dc.publisher | ELSEVIER SCIENCE BV | |
dc.relation.ispartof | OPERATIONS RESEARCH LETTERS | |
dc.subject | 2-factor | |
dc.subject | 2-FACTORIZATIONS | |
dc.subject | complete graph | |
dc.subject | oberwolfach problem | |
dc.subject | Operations Research & Management Science | |
dc.subject | sports scheduling | |
dc.title | Scheduling sports tournaments on a single court minimizing waiting times | |
dc.type | journal article | |
dc.identifier.doi | 10.1016/j.orl.2007.11.006 | |
dc.identifier.isi | ISI:000258057400016 | |
dc.description.volume | 36 | |
dc.description.issue | 4 | |
dc.description.startpage | 471 | |
dc.description.endpage | 476 | |
dc.publisher.place | PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS | |
dcterms.isPartOf.abbreviation | Oper. Res. Lett. | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KnSi808 | - |
Seitenaufrufe
12
Letzte Woche
0
0
Letzter Monat
9
9
geprüft am 07.06.2024