Westphal, Stephan

[["dc.bibliographiccitation.firstpage","347"],["dc.bibliographiccitation.issue","1"],["dc.bibliographiccitation.journal","Annals of Operations Research"],["dc.bibliographiccitation.lastpage","360"],["dc.bibliographiccitation.volume","218"],["dc.contributor.author","Westphal, Stephan"],["dc.contributor.author","Noparlik, Karl"],["dc.date.accessioned","2018-11-07T09:38:07Z"],["dc.date.available","2018-11-07T09:38:07Z"],["dc.date.issued","2014"],["dc.description.abstract","In this paper we propose an approximation for the Traveling Tournament Problem which is the problem of designing a schedule for a sports league consisting of a set of teams T such that the total traveling costs of the teams are minimized. It is not allowed for any team to have more than k home-games or k away-games in a row. We propose an algorithm which approximates the optimal solution by a factor of 2+2k/n+k/(n-1)+3/n+3/(2a <...k) which is not more than 5.875 for any choice of k >= 4 and n >= 6. This is the first constant factor approximation for k > 3. We furthermore show that this algorithm is also applicable to real-world problems as it produces solutions of high quality in a very short amount of time. It was able to find solutions for a number of well known benchmark instances which are even better than the previously known ones."],["dc.identifier.doi","10.1007/s10479-012-1061-1"],["dc.identifier.isi","000339330000021"],["dc.identifier.purl","https://resolver.sub.uni-goettingen.de/purl?gs-1/12111"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/32997"],["dc.notes.intern","Merged from goescholar"],["dc.notes.status","zu prüfen"],["dc.notes.submitter","Najko"],["dc.publisher","Springer"],["dc.relation.issn","1572-9338"],["dc.relation.issn","0254-5330"],["dc.rights","Goescholar"],["dc.rights.uri","https://goescholar.uni-goettingen.de/licenses"],["dc.title","A 5.875-approximation for the Traveling Tournament Problem"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","yes"],["dc.type.status","published"],["dc.type.version","published_version"],["dspace.entity.type","Publication"]]